A parallel pairwise local sequence alignment algorithm

IEEE Transactions on Nanobioscience

Volumn 8, Issue 2, 2009, Pages 139-146

  Bandyopadhyay, Sanghamitra ^a   Mitra, Ramkrishna ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Basic local alignment search tool (BLAST); Message passing interface (MPI); Parallel computing; Smith waterman (SW).

Indexed keywords

BASIC LOCAL ALIGNMENT SEARCH TOOL (BLAST); BASIC LOCAL ALIGNMENT SEARCH TOOLS; CLUSTER COMPUTER; DATABASE SEARCHING; HIGH SENSITIVITY; LOCAL SEQUENCES; MEGABASE; MESSAGE PASSING INTERFACE (MPI); PAIRWISE SEQUENCE ALIGNMENT; PARALLEL COMPUTING; PARALLELIZATIONS; POSSIBLE SOLUTIONS; SMITH-WATERMAN; SMITH-WATERMAN (SW).; SPACE AND TIME; TIMING REQUIREMENTS;

ALIGNMENT; CLUSTER COMPUTING; CLUSTERING ALGORITHMS; COMPUTER SCIENCE; HEURISTIC ALGORITHMS; MESSAGE PASSING; PARALLEL ARCHITECTURES; RADIO TELESCOPES; SEARCH ENGINES;

PARALLEL ALGORITHMS;

ALGORITHM; ARTICLE; CLUSTER ANALYSIS; COMPUTER; DATA BASE; SENSITIVITY ANALYSIS; SEQUENCE ALIGNMENT;

ALGORITHMS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; SEQUENCE HOMOLOGY;

EID: 68949106265     PISSN: 15361241     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNB.2009.2019642     Document Type: Article

References (40)

1. D. A. Benson, I. Karsch-Mizrachi, D. J. Lipman, J. Ostell, B. A. Rapp, and D. L. Wheeler, "GenBank", Nucleic Acids Res., vol. 28, pp. 15-18, 2000.
2. T. F. Smith and M. S. Waterman, "Identification of common molecular subsequences", J. Mol. Biol., vol. 147, pp. 195-197, 1981.
3. O. Gotoh, "An improved algorithm for matching biological sequences", J. Mol. Biol., vol. 162, pp. 705-708, 1982.
4. E. W. Myers, "An O(ND) difference algorithm and its variations", Algorithmica, vol. 1, pp. 251-266, 1986.
5. E.W.Myers and W.Miller, "Optimal alignments in linear space", Bioinf. Oxford J., vol. 4, pp. 11-17, 1988.
6. S. Batzoglou, L. Pachter, J. P. Mesirov, B. Berger, and E. S. Lander, "Human and mouse gene structure: Comparative analysis and application to exon prediction", Genome Res, vol. 10, pp. 950-958, 2000.
7. M. Brudno, C. B. Do, G. M. Cooper, M. F. Kim, E. Davydov; NISC Comparative Sequencing Program, E. D. Green, A. Sidow, and S. Batzoglou, "LAGAN and multi-LAGAN: Efficient tools for large-scale multiple alignment of genomicDNA", Genome Res., vol. 13, pp. 721-731, 2003.
8. W. Pearson and D. Lipman, "Improved tools for biological sequence comparison", Proc. Nat. Acad. Sci. USA, vol. 85, pp. 2444-2488, 1988.
9. S. F. Altschul, W. Gish, W. Miller, E.W.Myers, and D. J. Lipman, "Basic local alignment search tool", J. Mol. Biol., vol. 215, pp. 403-410, 1990.
10. S. F. Altschul, T. L.Madden, A. A. Schäffer, J. Zhang, Z. Zhang, W. Miller, and D. J. Lipman, "Gapped BLAST and PSI-BLAST: A new generation of protein database search programs", Nucleic Acids Res, vol. 25, pp. 3389-3402, 1997.
11. Z. Zhang, S. Schwartz, L.Wagner, and W.Miller, "A greedy algorithm for aligning DNA sequences", J. Comput. Biol., vol. 7, pp. 203-214, 2000.
12. T. A. Tatusova and T. L. Madden, "BLAST 2 SEQUENCES, A new tool for comparing protein and nucleotide sequences", FEMSMicrobiol. Lett., vol. 174, pp. 247-250, 1999.
13. W. Gish. (1995). WU-BLAST [Online]. Available: http://blast.wustl.edu/
14. S. Schwartz, Z. Zhang, K. A. Frazer, A. Smit, C. Riemer, J. Bouck, R. Gibbs, R.Hardison, and W.Miller, "PipMaker-A web server for aligning two genomic DNA sequences", Genome Res., vol. 10, pp. 577-586, 2000.
15. B. Ma, J. Tromp, and M. Li, "Pattern Hunter: Faster and more sensitive homology search", Bioinformatics, vol. 18, pp. 440-445, 2002.
16. W. J. Kent, "BLAT-The BLAST-like alignment tool", Genome Res., vol. 12, pp. 656-664, 2002.
17. Z. Ning, A. J. Cox, and J. C. Mullikin, "SSAHA: A fast search method for large DNA databases", Genome Res, vol. 11, pp. 1725-1729, 2001.
18. T. Kahveci, V. Ljosa, and A. K. Singh, "Speeding up whole-genome alignment by indexing frequency vectors", Bioinformatics, vol. 20, pp. 2122-2134, 2004.
19. K. R. Rasmussen, J. Stoye, and E. W. Myers, "Efficient q-gram filters for finding all epsilon-matches over a given length", in Proc. 9th Conf. Comput. Mol. Biol. (RECOMB), Cambridge, MA, 2005, pp. 189-203.
20. K. J. Kalafus, A. R. Jackson, and A. Milosavljevic, "Pash: Efficient genome-scale sequence anchoring by positional hashing", Genome Res., vol. 14, pp. 672-678, 2004.
21. A. L. Delcher, S. Kasif, R. D. Fleischmann, J. Peterson, O. White, and S. L. Salzberg, "Alignment of whole genomes", Nucleic Acids Res., vol. 27, pp. 2369-2376, 1999.
22. S. Burkhardt, A. Crauser, P. Ferragina, H. P. Lenhof, E. Rivals, and M. Vingron, "Q-gram based database searching using a suffix array (QUASAR)", in Proc. Annu. Int. Conf. Comput. Mol. Biol. (RECOMB), ACM Press, France, 1999, pp. 77-83.
23. S. Kurtz and C. Schleiermacher, "REPuter: Fast computation of maximal repeats in complete genomes", Bioinformatics, vol. 15, pp. 426-427, 1999.
24. N. Bray, I.Dubchak, andL. Pachter, "AVID:Aglobal alignment program", Genome Res., vol. 13, pp. 97-102, 2003.
25. R. Braun, K. T. Pedretti, T. L. Casavant, T. E. Scheetz, C. L. Birkett, and C. A. Roberts, "Parallelization of local blast service on workstation clusters", Future Gen. Comput. Syst., vol. 17, pp. 745-754, 2001.
26. N. Camp, H. Cofer, and R. Gomperts. (1998). High-throughput blast [Online]. Available: http://www.sgi.com/industries/sciences/chembio/resources/ papers/HTBlast/HTWhitepaper.html
27. E. H. Chi, E. Shoop, J. Carlis, E. Retzel, and J. Riedl, "Efficiency of shared memory multiprocessors for a genetic sequence similarity search algorithm", Comput. Sci. Dept., Univ. Minnesota, Crookston, Tech. Rep. TR97-05, 1997.
28. R. D. Bjornson, A. H. Sherman, S. B. Weston, N. Willard, and J. Wing, "Turboblast (r): A parallel implementation of blast built on TurboHub", in Proc. Int. Parallel Distrib. Process. Symp., 2002, p. 325.
29. D. Mathog, "Parallel blast on split databases", Bioinformatics, vol. 19, pp. 1865-1866, 2003.
30. A. E. Darling, L. Carey, and W. Feng, "The design, implementation, and evaluation of mpi-BLAST", presented at the Cluster World Conf. Expo, in Conjunction with 4th Int. Conf. Linux Clusters: The HPC Revolution, San Jose, CA, 2003.
31. H. Lin, X. Ma, P. Chandramohan, A. Geist, and N. Sarnatova, "Efficient data access for parallel blast", in Proc. Int. Parallel Distrib. Process. Symp., 2005, p. 72b.
32. T. Rognes, "ParAlign: A parallel sequence alignment algorithm for rapid and sensitive database searches", Nucleic Acid Res., vol. 29, pp. 1647- 1652, 2001.
33. E. C. Osório, J. E. de Souza, A. C. Zaiats, P. S. L. de Oliveira, and S. J. De Souza, "pp-Blast: A pseudo-parallel Blast", Braz. J. Med. Biol. Res., vol. 36, pp. 463-464, 2003.
34. C. Oehmen and J. Nieplocha, "ScalaBLAST: A scalable implementation of BLAST for high-performance data-intensive bioinformatics analysis", IEEE Trans. Parallel Distrib. Syst., vol. 17, no. 8, pp. 740-749, Aug. 2006.
35. T. Rognes and E. Seeberg, "Six-fold speed-up of Smith-Waterman sequence database searches using parallel processing on common microprocessors", Bioinformatics, vol. 16, pp. 699-706, 2000.
36. M. Farrar, "Striped Smith-Waterman speeds database searches six times over other SIMD implementations", Bioinformatics, vol. 23, pp. 156-161, 2007.
37. S. Henikoff and J. G. Henikoff, "Amino acid substitution matrices from protein blocks", Proc. Nat. Acad. Sci. USA, vol. 89, pp. 10915-10919, 1992.
38. J. M. Chandonia, G. Hon, N. S. Walker, L. L. Conte, P. Koehl, M. Levitt, and S. E. Brenner, "The ASTRAL compendium in 2004", Nucleic Acids Res., vol. 32, pp. D189-D192, 2004 (database issue).
39. S. Karlin and S. F. Altschul, "Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes", Proc. Nat. Acad. Sci. USA, vol. 87, pp. 2264-2268, 1990.
40. S. Karlin and S. F. Altschul, "Applications and statistics for multiple highscoring segments in molecular sequences", Proc. Nat. Acad. Sci. USA, vol. 90, pp. 5873-5877, 1993.