Acceleration of the Smith–Waterman algorithm using single and multiple graphics processors
Authors:
- Ali Khajeh-SaeedAKAli Khajeh-Saeed
- Stephen PooleSPStephen Poole
- J. Blair PerotJPJ. Blair Perot
- 1 June 2010
- journal article
- Published by Elsevier in Journal of Computational Physics
- Vol. 229 (11) , 4247-4258
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- The new SIMD Implementation of the Smith-Waterman Algorithm on Cell MicroprocessorFundamenta Informaticae, 2009
- An efficient implementation of Smith Waterman algorithm on GPU using CUDA, for massively parallel scanning of sequence databases2009
- CBESW: Sequence Alignment on the Playstation 3BMC Bioinformatics, 2008
- Striped Smith–Waterman speeds database searches six times over other SIMD implementationsBioinformatics, 2006
- Six-fold speed-up of Smith–Waterman sequence database searches using parallel processing on common microprocessorsBioinformatics, 2000
- Microparallelism and high-performance protein matching1995
- Basic local alignment search toolJournal of Molecular Biology, 1990
- Improved tools for biological sequence comparison.Proceedings of the National Academy of Sciences, 1988
- Rapid and Sensitive Protein Similarity SearchesScience, 1985
- Identification of common molecular subsequencesJournal of Molecular Biology, 1981