A domain decomposition strategy for alignment of multiple biological sequences on multiprocessor platforms

Journal of Parallel and Distributed Computing

Volumn 69, Issue 7, 2009, Pages 666-677

  Saeed, Fahad ^a   Khokhar, Ashfaq ^a  

^a 1120 Science and Engineering Offices   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL SEQUENCES; CLUSTER OF WORKSTATIONS; COMPUTATIONAL BIOLOGY; DATA SET SIZE; DOMAIN DECOMPOSITIONS; EVOLUTIONARY ORIGIN; EXECUTION TIME; FUNDAMENTAL PROBLEM; HAPLOTYPE; HEURISTIC APPROACH; MEMORY REQUIREMENTS; MULTI-PROCESSOR PLATFORMS; MULTIPLE SEQUENCES; MUSCLE SYSTEM; NOVEL DOMAIN; NP-HARD; PHYLOGENETIC ANALYSIS; PROBLEM SIZE; PROCESSING NODES; SCALABLE ALGORITHMS; SEQUENCE ANALYSIS; SEQUENCE HOMOLOGY; SPEED-UP; TIME COMPLEXITY; WIDE-RANGING APPLICATIONS;

ALGORITHMS; ALIGNMENT; BIOINFORMATICS; COMPUTATIONAL COMPLEXITY; DOMAIN DECOMPOSITION METHODS; HEURISTIC METHODS;

HEURISTIC ALGORITHMS;

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

References (43)

1. Berger M.J., and Bokhari S.H. A partitioning strategy for nonuniform problems on multiprocessors. IEEE Transactions on Computers 36 5 (1987) 570-580
2. S.H. Bokhari, T.W. Crockett, D.M. Nicol, Binary dissection: Variants and applications, Tech. Rep. 97-29, ICASE, 1997
3. K. Chaichoompu, S. Kittitornkun, S. Tongsima, Mt-clustal-w: Multithreading multiple sequence alignment, in: Sixth IEEE International Workshop on High Performance Computational Biology, March 2007
4. J. Cheetham, F. Dehne, A. Rau-chaplin, P.J. Taillon, Parallel clustal w for pc clusters, in: Proceedings of International Conference on Computational Science and Its Applications, ICCSA 2003, 2003, pp. 300-309
5. Cline M., Hughey R., and Karplus K. Predicting reliable regions in protein sequence alignments. Bioinformatics 18 2 (2002) 306-314
6. Crandall P.E., and Quinn M.J. Non-uniform 2-D grid partitioning for heterogeneous parallel architectures. IEEE Symposium on Parallel and Distributed Processing (1995), IEEE, Los Alamitos, CA 428-435
7. X. Deng, E. Li, J. Shan, W. Chen, Parallel implementation and performance characterization of muscle, in: International Parallel and Distributed Processing Symposium, IPDPS, 2006
8. Do C., Mahabhashyam M., Brudno M., and Batzoglou S. Probcons: Probabilistic consistency-based multiple sequence alignment. Genome Research 15 (2005) 330-340
9. Edgar R.C. Muscle: Multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Research 32 5 (2004)
10. Edgar R.C. Local homology recognition and distance measures in linear time using compressed amino acid alphabets. Nucleic Acids Research 32 (2004) 380-385
11. Edgar R.C. Muscle: A multiple sequence alignment method with reduced time and space complexity. BMC Bioinformatics (2004) 1471-2105
12. Hambrusch S.E., Hameed F., and Khokhar A.A. Communication operations on coarse-grained mesh architectures. Parallel Computing 21 5 (1995) 731-751
13. 3: A parallel model for coarse-grained machines. Journal of Parallel and Distributed Computing 32 2 (1996) 139-154
14. Hanmao S., and Jonathan S. Parallel sorting by regular sampling. Journal of Parallel and Distributed Computing 14 4 (1992) 361-372
15. J.S. Huang, Y.C. Chow, Parallel sorting and data partitioning by sampling, in: Proceedings of the IEEE Computer Society's Seventh International Computer Software and Applications Conference, 1983, pp. 627-631
16. Jones D.T., Taylor W.R., and Thornton J.M. The rapid generation of mutation data matrices from protein sequences. BMC Bioinformatics 8 3 (1991) 275-282
17. Kaddoura M., Ou C.-W., and Ranka S. Partitioning unstructured computational graphs for nonuniform and adaptive environments. IEEE, Parallel and Distributed Technology: Systems and Applications 03 3 (1995) 63-69
18. Kumar V., Grama A., Gupta A., and Karpis G. Introduction to Parallel Computing: Design and Analysis of Parallel Algorithms (1994), Benjamin-Cummings Pub. Co.
19. Lassmann T., and Sonnhammer E. Kalign - An accurate and fast multiple sequence alignment algorithm. BMC Bioinformatics 6 1 (2005) 298
20. Lassmann T., and Sonnhammer E.L. Quality assessment of multiple alignment programs. FEBS Letters 529 (2002) 126-130
21. Mikhailov D., Cofer H., and Gomperts R. Performance optimization of clustalw: Parallel clustalw, ht clustal, and multiclustal. Silicon Graphics. CA vol. White papers (2001)
22. Morgenstern B. Dialign: Multiple dna and protein sequence alignment at bibiserv. Nucleic Acids Research 32 (2004) W33-W36
23. Muller T., Spang R., and Vingron M. Estimating amino acid substitution models: A comparison of dayhoff's estimator, the resolvent approach and a maximum likelihood method. Molecular Biology Evolution 19 1 (2002) 8-13
24. Notredame C. Recent evolutions of multiple sequence alignment algorithms. PLoS Computational Biology 3 (2007) e123
25. Notredame C., Higgins D., and Heringa J. T-coffee: A novel method for multiple sequence alignments. Journal of Molecular Biology 302 (2000) 205-217
26. Pilkington J.R., and Baden S.B. Dynamic partitioning of non-uniform structured workloads with spacefilling curves. IEEE Transactions on Parallel and Distributed Systems 7 3 (1996) 288-300
27. Ronaghi M. Pyrosequencing sheds light on dna sequencing. Genome Research 11 1 (2001) 3-11
28. F. Saeed, A. Khokhar, Sample-Align-D: A high performance multiple sequence alignment system using phylogenetic sampling and domain decomposition, in: Proc. 23rd IEEE International Parallel and Distributed Processing Symposium, April 2007
29. Saeed F., Khokhar A., Zagordi O., and Beerenwinkel N. Multiple sequence alignment system for pyrosequencing reads. Bioinformatics and Computational Biology, BICoB. LNBI vol. 5462 (2009) 362-375
30. Sauder J.M., Arthur J.W., and Dunbrack R.L. Large-scale comparison of protein sequence alignment algorithms with structure alignments. Proteins 40 (2000) 6-22
31. Schmollinger M., Nieselt K., Kaufmann M., and Morgenstern B. Dialign p: Fast pair-wise and multiple sequence alignment using parallel processors. BMC Bioinformatics 5 September (2004) 128
32. Schwartz A.S., and Pachter L. Multiple alignment by sequence annealing. Bioinformatics 23 2 (2007) e24-e29
33. SF A. Amino acid substitution matrices from an information theoretic prospective. Journal of Molecular Biology 219 3 (1991) 555-565
34. Smith T.F., and Waterman M.S. Identification of common molecular subsequences. Journal of Molecular Biology 147 (1981) 195-197
35. Stoye J., Evers D., and Meyer F. Rose: Generating sequence families. Bioinformatics 14 March (1998) 157-163
36. Sze S.-H., Lu Y., and Yang Q. A polynomial time solvable formulation of multiple sequence alignment. Journal of Computational Biology 13 2 (2006) 309-319 PMID: 16597242
37. Thompson J., Higgins D., and Gibson T.J. Clustal w: Improving the sensitivity of progressive multiple alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Research 222 (1994) 4673-4690
38. Thompson J.D., Plewniak F., and Poch O. Balibase: A benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics 15 1 (1999) 87-88
39. Wang L., and Jiang T. On the complexity of multiple sequence alignment. Journal of Computational Biology 1 4 (1994) 337-348
40. Willebeek-LeMair M., and Reeves A. Strategies for dynamic load balancing on highly parallel computers. IEEE Transactions on Parallel and Distributed Systems 4 Sep (1993) 979-993
41. F. Zhang, X. Qiao, Z. Liu, A parallel smith-waterman algorithm based on divide and conquer, in: ica3pp, vol. 00, 2002, p. 0162
42. J. Zola, D. Trystram, A. Tchernykh, C. Brizuela, Parallel multiple sequence alignment with local phylogeny search by simulated annealing, in: Sixth IEEE International Workshop on High Performance Computational Biology, March 2007
43. J. Zola, X. Yang, A. Rospondek, S. Aluru, Parallel T-Coffee: A parallel multiple sequence aligner, in: ISCA PDCS, 2007, pp. 248-253