pith. sign in

arxiv: 1309.1895 · v1 · pith:7QWGP55Anew · submitted 2013-09-07 · 🧬 q-bio.GN · q-bio.BM

Fast and Exact Sequence Alignment with the Smith-Waterman Algorithm: The SwissAlign Webserver

classification 🧬 q-bio.GN q-bio.BM
keywords algorithmsmith-watermanblastexactswissalignwebserverearlierfast
0
0 comments X
read the original abstract

It is demonstrated earlier that the exact Smith-Waterman algorithm yields more accurate results than the members of the heuristic BLAST family of algorithms. Unfortunately, the Smith-Waterman algorithm is much slower than the BLAST and its clones. Here we present a technique and a webserver that uses the exact Smith-Waterman algorithm, and it is approximately as fast as the BLAST algorithm. The technique unites earlier methods of extensive preprocessing of the target sequence database, and CPU-specific coding of the Smith-Waterman algorithm. The SwissAlign webserver is available at the http://swissalign.pitgroup.org address.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.