Handling biological sequence alignments on networked computing systems: A divide-and-conquer approach

Journal of Parallel and Distributed Computing

Volumn 69, Issue 10, 2009, Pages 854-865

  Bharadwaj, Veeravalli ^a   Wong, Han Min ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Biological sequences; Communication delay; Divisible load theory; Linear networks; Sequence alignment; Smith Waterman algorithm

Indexed keywords

BIOLOGICAL SEQUENCES; COMMUNICATION DELAY; DIVISIBLE LOAD THEORY; SEQUENCE ALIGNMENT; SMITH-WATERMAN ALGORITHM;

ALIGNMENT; BIOINFORMATICS; COMPUTER SCIENCE; DNA; GENES; NUCLEIC ACIDS; OPTIMIZATION;

LINEAR NETWORKS;

EID: 68849122267     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2009.04.014     Document Type: Article

References (35)

1. Adrianto W., Kwoh C.K., and Bertil S. Parallel DNA Sequence Alignment on the Cell Broadband Engine. LNCS vol. 4967/2008 (2008), Springer, Berlin 1249-1256
2. Altschul S.F., Gish W., Miller W., Myers E.W., and Lipman D. A basic local alignment search tool. Journal of Molecular Biology 215 (1990) 403-410
3. Baldi P., and Brunak S. Bioinformatics: The Machine Learning Approach (1998), MIT Press
4. Baldridgr K., and Bourne P.E. The New Biology and the Grid, Grid Computing Making the Global Infrastructure a Reality (2003), Wiley
5. Benson D.A., Karsch-Mizrachi I., Lipman D.J., Ostell J., Rapp B.A., and Wheeler D.L. GenBank. Nucleic Acids Research 28 1 (2000) 15-18
6. Berger M.P., and Munson P.J. A novel randomized iteration strategy for aligning multiple protein sequences. Computer Applications in the Bioscience 7 (1991) 479-484
7. Bharadwaj V., Ghose D., Mani V., and Robertazzi T.G. Scheduling Divisible Loads in Parallel and Distributed Systems (1996), IEEE Computer Society Press, Los Almitos, California
8. A. Califano, I. Rigoutsos, FLASH: A fast look-up algorithm for string homology, in: Proceedings of the First International Conference on Intelligent Systems for Molecular Biology, 1993, pp. 56-64
9. Dayhoff M., Schwartz R.M., and Orcutt B.C. A model of evolutionary change in proteins. Atlas of Protien Sequences and Structure 5 (1978) 345-352
10. Debasish D., and Kim H.J. Load partitioning and trade-off study for large matrix-vector computations in multicast bus networks with communication delays. Journal of Parallel and Distributed Computing 55 1 (1998) 32-59
11. Diana L.H., Bharadwaj V., and Bader D. On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures. Journal of Parallel and Distributed Computing 67 9 (2007) 1007-1017
12. DNA Data Bank of Japan, http://www.ddbj.nig.ac.jp
13. Do C.B., Mahabhashyam M.S., Brudno M., and Batzoglou S. ProbCons: Probabilistic consistency-based multiple sequence alignment. Genome Research 15 2 (2005) 330-340
14. Edgar R.C. MUSCLE: Multiple sequence alignment with high accuracy and high throughput. Nuclic Acids Research 32 5 (2004) 1792-1797
15. Eidhammer I., Jonassen I., and Taylor W.R. Protein Bioinformatics: An Algorithmic Approach to Sequence and Structure Analysis (2004), John Wiley & Sons
16. The EMBL (European Molecular Biology Laboratory) Nucleotide Sequence Database, http://www.ebi.ac.uk/embl
17. W. Feng, Green Destiny+mpiBLAST=Bioinformagic, in: The proceedings of the International Conference on Parallel Computing, ParCo 2003, September 2003
18. GenBank, http://www.ncbi.nlm.nih.gov
19. Gotoh O. An improved algorithm for matching biological sequences. Journal of Molecular Biology 162 (1982) 705-708
20. Gribskov M., and John D. Sequence Analysis Primer. University of Wisconsin Biotechnology Center, UWBC, Biotech Resource Series (1991)
21. Lipman D.J., and Pearson W.R. Rapid and sensitive protein similarity searches. Science 227 (1985) 1435-1441
22. Morgenstern B. DiAlign 2: Improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics 15 3 (1999) 211-218
23. Needleman S.B., and Wunsch C.D. A general method applicable to the search for similarities in the amino acid sequence of two sequences. Journal of Molecular Biology 48 (1970) 443-453
24. Notredame C., Higgins D.G., and Heringa J. T-Coffee: A novel method for fast and accurate multiple sequence alignment. Journal of Molecular Biology 302 1 (2000) 205-217
25. Pearson W.R. Rapid and sensitive sequence comparison with FASTA and FASTP. Methods in Enzymology 183 (1990) 63-98
26. Pearson W.R., and Lipman D.J. Improved tools for biological sequence comparison. Proceedings of the National Academy of Sciences of the United States of America 85 (1988) 2444-2448
27. Sellers P.H. On the theory and computation of evolutionary distances. SIAM Journal of Applied Mathematics 26 (1974) 787-793
28. Smith T.F., and Waterman M.S. Identification of common molecular subsequence. Journal of Molecular Biology 147 (1981) 195-197
29. Waterman M.S., Smith T.F., and Beyer W.A. Some biological sequence metrics. Advances in Mathematics 20 (1976) 367-387
30. Wong H.M., and Bharadwaj V. Aligning biological sequences on distributed bus networks: A divisible load scheduling approach. IEEE Transactions on Information Technology in BioMedicine 9 4 (2005) 489-501
31. J. Yao, L.N. Bhuyan, Scheduling real-time multimedia tasks in network processors, in: IEEE Globecom, Global Internet and Next Generation Systems Symposium, November 2004
32. Yap T.K., Frieder O., and Martino R.L. High Performance Computational Methods for Biological Sequence Analysis (1996), Kluwer Academic Publishers
33. Yap T.K., Ophir F., and Robert L. Parallel computation in biological sequence analysis. IEEE Transactions on Parallel and Distributed Systems 9 3 (1998)
34. J. Zola, X. Yang, S. Rospondek, S. Aluru, Parallel T-Coffee: A parallel multiple sequence aligner, in: Proc. of ISCA PDCS-2007, 2007, pp. 248-253
35. Zomaya A.Y. Parallel Computing for Bioinformatics and Computational Biology. John Wiley Series on Parallel and Distributed Computing (2006)