On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures

Journal of Parallel and Distributed Computing

Volumn 67, Issue 9, 2007, Pages 1007-1017

  Low, Diana H P ^a   Veeravalli, Bharadwaj ^a   Bader, David A ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Georgia Institute of Technology   (United States)

Author keywords

Divisible loads; Mesh topology; Multiple sequence alignment; Protein sequences; Smith Waterman algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; HEURISTIC METHODS; PROTEINS;

DIVISIBLE LOADS; MESH TOPOLOGY; MULTIPLE SEQUENCE ALIGNMENT; OLFACTORY RECEPTORS; PARALLELISM; PROTEIN SEQUENCES; SMITH-WATERMAN ALGORITHM;

MULTIPROCESSING SYSTEMS;

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

References (36)

1. Altschul S.F., Gish W., Miller W., Myers E.W., and Lipman D. A basic local alignment search tool. J. Mol. Biol. 215 (1990) 403-410
2. Barton G.J., and Sternberg M.J. A strategy for the rapid multiple alignment of protein sequences. Confidence levels from tertiary structure comparisons. J. Mol. Biol. 198 2 (1987) 327-337
3. Benson D.A., Ilene K.-M., David J.L., James O., Barbara A.R., and David L.W. GenBank. Nucleic Acids Res. 28 1 (2000) 15-18
4. Berger M.P., and Munson P.J. A novel randomized iteration strategy for aligning multiple protein sequences. Comput. Appl. Biosci. 7 (1991) 479-484
5. V. Bharadwaj, G. Debasish, G.R. Thomas, Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems, Special Issue on Divisible Load Scheduling in Cluster Computing, vol. 6(1), Kluwer Academic Publishers, Dordrecht, 2003.
6. Bharadwaj V., Debasish G., Venkataraman M., and Thomas G.R. Scheduling Divisible Loads in Parallel and Distributed Systems (1996), IEEE Computer Society Press, Los Almitos, California
7. Califano A., and Rigoutsos I. FLASH: a fast look-up algorithm for string homology. Proceedings of the First International Conference on Intelligent Systems for Molecular Biology (1993) 56-64
8. CLUSTALW, 〈http://www.ebi.ac.uk/clustalw/〉.
9. DNA Data Bank of Japan, 〈http://www.ddbj.nig.ac.jp〉.
10. Eidhammer I., Jonassen I., and Taylor W.R. Protein Bioinformatics: An Algorithmic Approach to Sequence and Structure Analysis (2004), Wiley, New York ISBN: 0-470-84839-1
11. W. Feng, Green Density + mpiBLAST = Bioinfomagic, in: The Proceedings of International Conference on Parallel Computing (ParCo 2003), September 2003.
12. GenBank, 〈http://www.ncbi.nlm.nih.gov〉.
13. Gotoh O. An improved algorithm for matching biological sequences. J. Mol. Biol. 162 (1982) 705-708
14. Goux J.P., Kulkarni S., Linderoth J., and Yoder M. An enabling framework for master-worker applications on the computational grid. Proceedings of High Performance Distributed Computing (HPDC) (2000) 43-50
15. K. Ko, T.G. Robertazzi, Equal allocation scheduling for data intensive applications, IEEE Trans. Aerospace Electron. Systems (2004).
16. Lipman D.J., and Pearson W.R. Rapid and sensitive protein similarity searches. Science 227 (1985) 1435-1441
17. Martinez H.M. A flexible multiple sequence alignment program. Nucleic Acids Res. 16 5 Part A (1988) 1683-1691
18. Michael J.Q. Parallel Programming in C with MPI and OpenMP (2003), McGraw-Hill, New York, USA
19. Myers E.W. An O(ND) difference algorithm and its variations. Algorithmica 1 2 (1986) 251-266
20. Needleman S.B., and Wunsch C.D. A general method applicable to the search for similarities in the amino acid sequence of two sequences. J. Mol. Biol. 48 (1970) 443-453
21. Pearson W.R. Rapid and sensitive sequence comparison with FASTA and FASTP. Methods Enzymology 183 (1990) 63-98
22. Pearson W.R., and Lipman D.J. Improved tools for biological sequence comparison. Proc. Nat. Acad. Sci. USA 85 (1988) 2444-2448
23. Pekurovsky D., Shindyalov I.N., and Bourne P.E. A case study of high-throughput biological data processing on parallel platforms. Bioinformatics 20 (2004) 1940-1947
24. Robertazzi T.G. Ten reasons to use divisible load theory. Computer 36 5 (2003) 63-68
25. Rognes T., and Erling S. Six-fold speed-up of Smith Waterman sequence database searches using parallel processing on common microprocessors. Bioinformatics 16 8 (2000) 699-706
26. Sellers P.H. On the theory and computation of evolutionary distances. SIAM J. Appl. Math. 26 (1974) 787-793
27. Smith T.F., and Waterman M.S. Identification of common molecular subsequence. J. Mol. Biol. 147 (1981) 195-197
28. Taylor W.R. Multiple sequence alignment by a pairwise algorithm. Comput. Appl. Biosci. 3 2 (1987) 81-87
29. The EMBL (European Molecular Biology Laboratory) Nucleotide Sequence Database, 〈http://www.ebi.ac.uk/embl〉.
30. Trelles O., Andrade M.A., Valencia A., Zapata E.L., and Carazo J.M. Computational space reduction and parallelization of a new clustering approach for large groups of sequences. Bioinformatics 14 5 (1998) 439-451
31. Waterman M.S. Mathematical Methods for DNA Sequences (1986), CRC Press Inc., Boca Raton, FL
32. Waterman M.S., Smith T.F., and Beyer W.A. Some biological sequence metrics. Adv. Math. 20 (1976) 367-387
33. Wong H.M., and Bharadwaj V. Aligning biological sequences on distributed bus networks: a divisible load scheduling approach. IEEE Trans. Inform. Technol. Biomed. 9 4 (2005) 1910-1924
34. Yap T.K., Frieder O., and Martino R.L. High Performance Computational Methods for Biological Sequence Analysis (1996), Kluwer Academic Publishers, Dordrecht
35. Yap T.K., Frieder O., and Martino R.L. Parallel computation in biological sequence analysis. IEEE Trans. Parallel Distrib. Systems 9 3 (1998)
36. Zhang X., and Yan Y. Modeling and characterizing parallel computing performance on heterogeneous networks of workstations. Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing (October 1995)