FPGA-Based Smith-Waterman Algorithm: Analysis and Novel Design
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 181-192
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- CUDASW++: optimizing Smith-Waterman sequence database searches for CUDA-enabled graphics processing unitsBMC Research Notes, 2009
- CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignmentBMC Bioinformatics, 2008
- Families of FPGA-based accelerators for approximate string matchingMicroprocessors and Microsystems, 2007
- Sensitivity and Selectivity in Protein Similarity Searches: A Comparison of Smith–Waterman in Hardware to BLAST and FASTAGenomics, 1996
- Comparison of methods for searching protein sequence databasesProtein Science, 1995
- Amino acid substitution matrices from an information theoretic perspectiveJournal of Molecular Biology, 1991
- Basic local alignment search toolJournal of Molecular Biology, 1990
- An improved algorithm for matching biological sequencesJournal of Molecular Biology, 1982
- Identification of common molecular subsequencesJournal of Molecular Biology, 1981
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970