Making automated multiple alignments of very large numbers of protein sequences

Bioinformatics

Volumn 29, Issue 8, 2013, Pages 989-995

  Sievers, Fabian ^a   Dineen, David ^b   Wilm, Andreas ^c   Higgins, Desmond G ^a  

^a UNIVERSITY COLLEGE DUBLIN   (Ireland)

^b University of California at Berkeley   (United States)

^c GENOME INSTITUTE OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER PROGRAM; METHODOLOGY; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS;

ALGORITHMS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, PROTEIN; SOFTWARE;

EID: 84876220535     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btt093     Document Type: Article

References (37)

1. Barton, GJ. and Sternberg, MJ. (1987) Evaluation and improvements in the auto- matic alignment of protein sequences. Protein Eng., 1, 89-94.
2. Berger, S.A. and Stamatakis, A. (2011) Aligning short reads to reference alignments and trees. Bioinformatics, 27, 2068-2075.
3. Blackshields, G. et al. (2010) Sequence emBedding for fast construction of guide trees for multiple sequence alignment. Algorithms Mol. Biol., 5, 21.
4. Bradley, R.K. et al. (2009) Fast statistical alignment. PLoS Comput. Biol., 5, e1000392.
5. Breen, M.S. et al. (2012) Epistasis as the primary factor in molecular evolution. Nature, 490, 535-538.
6. Do, C.B. et al. (2005) ProbCons: probabilistic consistency-based multiple sequence alignment. Genome Res., 15, 330-340.
7. Edgar, R.C. (2004) MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res., 32, 1792-1797.
8. Edgar, R.C. (2010) Search and clustering orders ofmagnitude faster than BLAST. Bioinformatics, 26, 2460-2461.
9. Finn, R.D. et al. (2011) HMMER web server: interactive sequence similarity searching. Nucleic Acids Res., 39 (Suppl. 2), W29-W37.
10. Katoh, K. et al. (2002) MAFFT: a novel method for rapid multiple sequence align- ment based on fast Fourier transform. Nucleic Acids Res., 30, 3059-3066.
11. Katoh, K. et al. (2005) MAFFT version 5: improvement in accuracy of multiple sequence alignment. Nucleic Acids Res., 33, 511-518.
12. Katoh, K. and Toh, H. (2007) PartTree: an algorithm to build an approximate tree from a large number ofunaligned sequences. Bioinformatics, 23, 372-374.
13. Katoh, K. and Frith, M.C. (2012) Adding unaligned sequences into an existing align- ment using MAFFT and LAST. Bioinformatics, 28, 3144-3146.
14. Kemena, C. and Notredame, C. (2009) Upcoming challenges for multiple sequence alignment methods in the high-throughput era. Bioinformatics, 25, 2455-2465.
15. Larkin, M.A. et al. (2007) Clustal W and Clustal X version 2.0. Bioinformatics, 23, 2947-2948.
16. Lassmann, T. and Sonnhammer, E.L (2005) Kalign-an accurate and fast multiple sequence alignment algorithm. BMC Bioinformatics, 6, 298.
17. Lee, C. et al. (2002) Multiple sequence alignment using partial order graphs. Bioinformatics, 18, 452-464.
18. Li, W. and Godzik, A. (2006) Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences. Bioinformatics, 22, 1658-1659.
19. Liu, K. et al. (2009) Rapid and accurate large-scale coestimation of sequence align- ments and phylogenetic trees. Science, 324, 1561-1564.
20. Liu, Y. et al. (2010) MSAProbs: multiple sequence alignment based on pair hidden Markov models and partition function posterior probabilities. Bioinformatics, 26, 1958-1964.
21. Loytynoja, A. and Goldman, N. (2008) Phylogeny-aware gap placement prevents errors in sequence alignment and evolutionary analysis. Science, 320, 1632-1635.
22. Loytynoja, A. et al. (2012) Accurate extension ofmultiple sequence alignments using a phylogeny-aware graph algorithm. Bioinformatics, 28, 1684-1691.
23. Marks, D.S. et al. (2011) Protein 3D structure computed from evolutionary sequence variation. PLoS One, 6, e28766.
24. Mizuguchi, K. et al. (2008) HOMSTRAD: a database of protein structure align- ments for homologous families. Protein Sci., 7, 2469-2471.
25. Morgenstern, B. et al. (1998) DIALIGN: finding local similarities by multiple se- quence alignment. Bioinformatics, 14, 290-294.
26. Notredame, C. et al. (2000) T-Coffee: a novel method for fast and accurate multiple sequence alignment. J. Mol. Biol., 302, 205-218.
27. Pei, J. and Grishin, N.V. (2006) MUMMALS: multiple sequence alignment im- proved by using hidden Markov models with local structural information. Nucleic Acids Res., 34, 4364-4374.
28. Pei, J. and Grishin, N.V. (2007) PROMALS: towards accurate multiple sequence alignments of distantly related proteins. Bioinformatics, 23, 802-808.
29. Punta, M. et al. (2012) The Pfam protein families database. Nucleic Acids Res., 40, D290-D301.
30. Roshan, U. and Livesay, D.R. (2006) Probalign: multiple sequence alignment using partition function posterior probabilities. Bioinformatics, 22, 2715-2721.
31. Shi, W. et al. (2010) A complete analysis of HA and NA genes of influenza A viruses. PLoS One, 5, e14454.
32. Sievers, F. et al. (2011) Fast, scalable generation of high-quality protein multiple sequence alignments using Clustal Omega. Mol. Syst. Biol., 7, 539.
33. Sze, S.H. et al. (2006) A polynomial time solvable formulation ofmultiple sequence alignment. J. Comput. Biol., 13, 309-319.
34. Simossis, V.A. and Heringa, J. (2005) PRALINE: a multiple sequence alignment toolbox that integrates homology-extended and secondary structure informa- tion. Nucleic Acids Res., 33 (Suppl. 2), W289-W294.
35. Thompson, J.D. et al. (2005) BAliBASE 3.0: latest developments of the multiple sequence alignment benchmark. Proteins, 61, 127-136.
36. Thompson, J.D. et al. (2011) A comprehensive benchmark study ofmultiple se- quence alignment methods: current challenges and future perspectives. PloS One, 6, e18093.
37. Wheeler, T.J. and Kececioglu, J.D. (2007) Multiple alignment by aligning alignments. Bioinformatics, 23, i559-i568.