Acceleration of smith-waterman using recursive variable expansion

Proceedings - 11th EUROMICRO Conference on Digital System Design Architectures, Methods and Tools, DSD 2008

Volumn , Issue , 2008, Pages 915-922

  Nawaz, Zubair ^a   Al Ars, Zaid ^a   Bertels, Koen ^a   Shabbir, Mudassir ^b  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b MENTOR GRAPHICS CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALIGNMENT; PAPER; RECURSIVE FUNCTIONS; SYSTEMS ANALYSIS;

ACCELERATION METHODS; ALIGNMENT SCORES; BIOLOGICAL SEQUENCES; HARDWARE OVERHEADS; LOCAL SEQUENCES; NEW APPROACHES; SPEED-UP; TYPICAL SEQUENCES;

ARCHITECTURAL DESIGN;

EID: 57649244271     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSD.2008.32     Document Type: Conference Paper

References (18)

1. S. F. Altschul et al. Basic local alignment search tool. J. Mol. Biol., pages 403-410, 1990.
2. D. A. Benson et al. Genbank. Nucl. Acids Res., 28(1):15-18, 2000.
3. A. D. Blas et al. The kestrel parallel processor. IEEE Transactions on Parallel and Distributed Systems, 16(1):80-92, 2005.
4. B. Boeckmann et al. The swiss-prot protein knowledgebase and its supplement trembl in 2003. Nucleic Acids Research, 31:365-370, 2003.
5. M. Borah et al. A simd solution to the sequence comparison problem on the mgap. In ASAP, 1994.
6. M. O. Dayhoff. Survey of new data and computer methods of analysis. In Atlas of Protein Sequence and Structure, volume 5, page 29, 1978.
7. M. Farrar. Striped smith-waterman speeds database searches six times over other simd implementations. Bioinformatics, 23(2):156-161, 2007.
8. M. Y. Galperin. The molecular biology database collection: 2007 update. Nucleic Acids Research, 35:D3-D4(1), January 2007.
9. L. Hasan, Z. Al-Ars, and S. Vassiliadis. Hardware acceleration of sequence alignment algorithms - an overview. In DTIS'07, pages 96-101, September 2007.
10. S. Henikoff and J. Henikoff. Amino acid substitution matrices from protein blocks. In Proceedings of the National Academy of Sciences, volume 89, pages 10915-10919, 1992.
11. X. Jiang et al. A reconfigurable accelerator for smith-waterman algorithm. IEEE Transactions on Circuits and Systems II, 54(12):1077-1081, Dec. 2007.
12. D. J. Lipman and W. R. Pearson. Rapid and sensitive sequence comparison with fastp and fasta. Methods Enzymol., 183:63-98, 1990.
13. Z. Nawaz et al. Recursive variable expansion: A loop transformation for reconfigurable systems. In ICFPT'07, 2007.
14. T. Oliver, B. Schmidt, and D. Maskell. Reconfigurable architectures for bio-sequence database scanning on fpgas. IEEE Transactions on Circuits and Systems II, 52(12):851-855, Dec. 2005.
15. B. Schmidt, H. Schröder, and M. Schimmler. Massively parallel solutions for molecular sequence analysis. In IPDPS '02, page 201, 2002.
16. T. Smith and M. Waterman. Identification of common molecular subsequences. J. Mol. Biol., 147:195-197, 1981.
17. D. States, W. Gish, and S. Altschul. Improved sensitivity of nucleic acid database search using application-specific scoring matrices. In Methods: A companion to Methods in Enzymology, volume 3, pages 66 - 77, 1991.
18. Y. Yamaguchi, Y. Miyajima, T. Maruyama, and A. Konagaya. High speed homology search using runtime reconfiguration. In FPL '02, pages 281-291, 2002.