DSP Processors Hit the Mainstream
Computer
TurboBLAST(r): A Parallel Implementation of BLAST Built on the TurboHub
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Massively Parallel Solutions for Molecular Sequence Analysis
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
IEEE Transactions on Parallel and Distributed Systems
Parallel genomic sequence-search on a massively parallel system
Proceedings of the 4th international conference on Computing frontiers
An adaptive data prefetching scheme for biosequence database search on reconfigurable platforms
Proceedings of the 2007 ACM symposium on Applied computing
Optimised fine and coarse parallelism for sequence homology search
International Journal of Bioinformatics Research and Applications
Solving the maximum subsequence problem with a hardware agents-based system
ICC'06 Proceedings of the 10th WSEAS international conference on Circuits
Hi-index | 0.00 |
With the dramatically increasing amounts of genomic sequence database, there is a need for faster and more sensitive searching for sequence similarity analysis. The Smith-Waterman algorithm, which utilizes dynamic programming, is a common method for performing exact local alignments between two protein or DNA sequences. The Smith-Waterman algorithm is exhaustive and generally considered to be the most sensitive, but long computation times limit the use of this algorithm. This paper presents a preliminary implementation of Smith-Waterman algorithm using a new chip multiprocessor architecture with multiple Digital Signal Processors (DSP) on a single chip leading to high performance at low cost.