Enhancing the scalability of consistency-based progressive multiple sequences alignment applications

Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium, IPDPS 2012

Volumn , Issue , 2012, Pages 71-82

  Orobitg, M ^a   Cores, F ^a   Guirado, F ^a   Kemena, C ^b   Notredame, C ^b   Ripoll, A ^c  

^a UNIVERSITY OF LLEIDA   (Spain)

^b UNIVERSITAT POMPEU FABRA   (Spain)

^c UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

Author keywords

Multiple sequence alignment; scalability; T Coffee

Indexed keywords

BIOLOGICAL APPLICATIONS; COMPUTATIONAL REQUIREMENTS; EXECUTION TIME; MEMORY CONSTRAINTS; MEMORY CONSUMPTION; MEMORY REQUIREMENTS; MULTIPLE SEQUENCE ALIGNMENTS; MULTIPLE SEQUENCES; OPTIMIZATION LEVELS; PHYLOGENETIC ANALYSIS; REDUCTION YIELD; SIGNIFICANT IMPACTS; STRUCTURE PREDICTION; T-COFFEE; TIME PERFORMANCE;

DISTRIBUTED PARAMETER NETWORKS;

SCALABILITY;

EID: 84866856761     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2012.17     Document Type: Conference Paper

References (35)

1. Wang L and Jiang T. On the complexity of multiple sequence alignment. Journal of computational biology, 1(4):337-348, 1994.
2. Notredame C. Recent evolutions of multiple sequence alignment algorithms. PLoS Comput Biol, 3(8):e123, 2007.
3. Feng DF and Doolittle RF. Progressive sequence alignment as a prerequisite to correct phylogenetic trees. Journal of molecular evolution, 25(4):351-360, 1987.
4. Notredame C, Higgins DG, and Heringa J. T-Coffee: a novel method for fast and accurate multiple sequence alignment. Journal of Molecular Biology, 302(1):205-217, 2000.
5. Notredame C, Holm L, and Higgins DG. COFFEE: an objective function for multiple sequence alignments. Bioinformatics, 14(5):407-422, 1998.
6. Hughey R and Krogh A. Hidden Markov models for sequence analysis: extension and analysis of the basic method. Comput Appl Biosci, 12(2):95-107, April 1996.
7. Di Tommaso P, Orobitg M, Guirado F, Cores F, Espinosa T, and Notredame C. Cloud-Coffee: implementation of a parallel consistency-based multiple alignment algorithm in the T-Coffee package and its benchmarking on the Amazon Elastic-Cloud. Bioinformatics, 26(15):1903-1904, 08 2010.
8. Needleman S and Wunsch C. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48(3):443-453, March 1970.
9. Smith TF and Waterman MS. Identification of common molecular subsequences. Journal of molecular biology, 147(1):195-197, March 1981.
10. Thompson J, Higgins D, and Gibson T. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Research, 22(22):4673-4680, 1994.
11. Katoh K, Kuma K-I, Toh H, and Miyata T. MAFFT version 5: improvement in accuracy of multiple sequence alignment. Nucleic Acids Research, 33(2):511-518, 2005.
12. Edgar RC. MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Research, 32(5):1792-1797, 2004.
13. Morgenstern B. DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics, 15(3):211-218, 1999.
14. Subramanian AR, Kaufmann M, and Morgenstern B. DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment. Algorithms for Molecular Biology, 3(6), 2008.
15. Sievers F, Wilm A, Dineen D, Gibson TJ, Karplus K, Li W, Lopez R, McWilliam H, Remmert M, Soding J, Thompson JD, and Higgins DG. Fast, scalable generation of high-quality protein multiple sequence alignments using Clustal Omega. Molecular Systems Biology, 7(1), October 2011.
16. Chen C and Schmidt B. Computing large-scale alignments on a multi-cluster. In Cluster Computing, 2003. Proceedings. 2003 IEEE International Conference on, pages 38-45, Dec. 2003.
17. Driga A, Lu P, Schaeffer J, Szafron D, Charter K, and Parsons I. FastLSA: a fast, linear-space, parallel and sequential algorithm for sequence alignment. In Parallel Processing, 2003. Proceedings. 2003 International Conference on, pages 48-57, oct. 2003.
18. Batista RB and Alves de Melo ACM. Z-align: An Exact and Parallel Strategy for Local Biological Sequence Alignment in User-Restricted Memory Space. In Cluster Computing, 2006 IEEE International Conference on, pages 1-10, Sept. 2006.
19. Rajko S and Aluru S. Space and Time Optimal Parallel Sequence Alignments. IEEE Trans. Parallel Distrib. Syst., 15:1070-1081, Dec. 2004.
20. Li K-B. ClustalW-MPI: ClustalW analysis using distributed and parallel computing. Bioinformatics, 19(12):1585-1586, 08 2003.
21. Zola J, Yang X, Rospondek S, and Aluru S. Parallel-TCoffee: A parallel multiple sequence aligner. In ISCA PDCS-2007, pages 248-253, 2007.
22. Schmollinger M, Nieselt K, Kaufmann M, and Morgenstern B. DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors. BMC Bioinformatics, 5(1):128, 2004.
23. Kruskal CP and Weiss A. Allocating Independent Subtasks on Parallel Processors. Software Engineering, IEEE Transactions on, SE-11(10):1001-1016, Oct. 1985.
24. Polychronopoulos CD and Kuck DJ. Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers. Computers, IEEE Transactions on, C-36(12):1425-1439, Dec. 1987.
25. Orobitg M, Guirado F, Notredame C, and Cores F. Exploiting parallelism on progressive alignment methods. The Journal of Supercomputing, pages 1-9, 2009.
26. Jung S. Parallelized pairwise sequence alignment using CUDA on multiple GPUs. BMC Bioinformatics, 10(Suppl 7):A3, 2009.
27. Liu W, Schmidt B, Voss G, and Müller-Wittig W. GPU-ClustalW: Using Graphics Hardware to Accelerate Multiple Sequence Alignment. In IEEE International Conference on High Performance Computing (HiPC 2006), volume 4297 of Lecture Notes in Computer Science (LNCS), pages 363-374, 2006.
28. Liu Y, Schmidt B, and Maskell DL. MSA-CUDA: Multiple Sequence Alignment on graphics processing units with CUDA. In Application-specific Systems, Architectures and Processors, 2009. ASAP 2009. 20th IEEE International Conference on, pages 121-128, July 2009.
29. Trapnell C and Schatz MC. Optimizing data intensive GPGPU computations for DNA sequence alignment. Parallel Computing, 35(8-9):429-440, 2009.
30. Huang X and Miller W. A time-efficient, linear-space local similarity algorithm. Advances in Applied Mathematics, 12:337-357, 1991.
31. Altschul SF, Gish W, Miller W, Myers EW, and Lipman DJ. Basic local alignment search tool. Journal of molecular biology, 215(3):403-410, October 1990.
32. Sander C and Schneider R. Database of homology-derived protein structures and the structural meaning of sequence alignment. Proteins: Structure, Function, and Genetics, 9(1):56-68, 1991.
33. Thompson JD, Plewniak F, and Poch O. BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics, 15(1):87-88, 1999.
34. Mizuguchi K, Deane CM, Blundell TL, and Overington JP. HOMSTRAD: a database of protein structure alignments for homologous families. Protein Sci, 7(11):2469-2471, November 1998.
35. Karplus K and Hu B. Evaluation of protein multiple alignments by SAM-T99 using the BAliBASE multiple alignment test set. Bioinformatics, 17(8):713-720, August 2001.