Multiple sequence alignments

Current Opinion in Structural Biology

Volumn 15, Issue 3 SPEC. ISS., 2005, Pages 261-266

  Wallace, Iain M ^a   Blackshields, Gordon ^a   Higgins, Desmond G ^a  

^a UNIVERSITY COLLEGE DUBLIN   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ACCURACY; ALGORITHM; AMINO ACID SEQUENCE; ANALYTIC METHOD; COMPUTER PROGRAM; DATA BASE; DNA SEQUENCE; INTERMETHOD COMPARISON; PRIORITY JOURNAL; PROTEIN DATA BANK; PROTEIN STRUCTURE; REVIEW; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS;

EID: 20444468783     PISSN: 0959440X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sbi.2005.04.002     Document Type: Review

References (48)

1. S.B. Needleman, and C.D. Wunsch A general method applicable to the search for similarities in the amino acid sequence of two proteins J Mol Biol 48 1970 443 453
2. D.J. Lipman, S.F. Altschul, and J.D. Kececioglu A tool for multiple sequence alignment Proc Natl Acad Sci USA 86 1989 4412 4415
3. C. Notredame, and D.G. Higgins SAGA: sequence alignment by genetic algorithm Nucleic Acids Res 24 1996 1515 1524
4. O. Gotoh Significant improvement in accuracy of multiple protein sequence alignments by iterative refinement as assessed by reference to structural alignments J Mol Biol 264 1996 823 838
5. Wallace IM, O'Sullivan O, Higgins DG: Evaluation of iterative alignment algorithms for multiple alignment. Bioinformatics 2004, doi:10.1093/ bioinformatics/bti159.
6. M. Hirosawa, Y. Totoki, M. Hoshida, and M. Ishikawa Comprehensive study on iterative algorithms of multiple sequence alignment Comput Appl Biosci 11 1995 13 18
7. D.F. Feng, and R.F. Doolittle Progressive sequence alignment as a prerequisite to correct phylogenetic trees J Mol Evol 25 1987 351 360
8. P. Hogeweg, and B. Hesper The alignment of sets of sequences and the construction of phyletic trees: an integrated method J Mol Evol 20 1984 175 186
9. G.J. Barton, and M.J. Sternberg A strategy for the rapid multiple alignment of protein sequences. Confidence levels from tertiary structure comparisons J Mol Biol 198 1987 327 337
10. D.G. Higgins, and P.M. Sharp CLUSTAL: a package for performing multiple sequence alignment on a microcomputer Gene 73 1988 237 244
11. F. Corpet Multiple sequence alignment with hierarchical clustering Nucleic Acids Res 16 1988 10881 10890
12. W.R. Taylor A flexible method to align large numbers of biological sequences J Mol Evol 28 1988 161 169
13. J.D. Thompson, D.G. Higgins, and T.J. Gibson CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice Nucleic Acids Res 22 1994 4673 4680
14. J.D. Thompson, T.J. Gibson, F. Plewniak, F. Jeanmougin, and D.G. Higgins The CLUSTAL_X windows interface: flexible strategies for multiple sequence alignment aided by quality analysis tools Nucleic Acids Res 25 1997 4876 4882
15. C. Notredame, D.G. Higgins, and J. Heringa T-Coffee: a novel method for fast and accurate multiple sequence alignment J Mol Biol 302 2000 205 217
16. J.D. Kececioglu The maximum weight trace problem in multiple sequence alignment A. Apostolico M. Crochemore Z. Galil U. Manber Lecture Notes In Computer Science vol 684 1993 Springer-Verlag 106 119
17. C. Notredame, L. Holm, and D.G. Higgins COFFEE: an objective function for multiple sequence alignments Bioinformatics 14 1998 407 422
18. C.B. Do, M.S. Mahabhashyam, M. Brudno, and S. Batzoglou ProbCons: probabilistic consistency-based multiple alignment of amino acid sequences Genome Res 15 2005 330 340 PROBCONS is like T-Coffee but uses probabilities for residue scores. T-Coffee is based on finding a multiple alignment that best matches a library of input pieces of information. These pieces are usually pairs of amino acids, each pair with a score that reflects how much we wish to align the pair in the final alignment. In the original T-Coffee, these scores were simply the percent identity of the parent pairwise alignment. In PROBCONS, these are posterior probabilities for pair-HMMs. PROBCONS is a very accurate alignment program.
19. O. O'Sullivan, K. Suhre, C. Abergel, D.G. Higgins, and C. Notredame 3DCoffee: combining protein sequences and structures within multiple sequence alignments J Mol Biol 340 2004 385 395 3D-Coffee is a practical method for mixing sequences and structures.
20. B. Al-Lazikani, F.B. Sheinerman, and B. Honig Combining multiple structure and sequence alignments to improve sequence detection and alignment: application to the SH2 domains of Janus kinases Proc Natl Acad Sci USA 98 2001 14796 14801
21. J. Shi, T.L. Blundell, and K. Mizuguchi FUGUE: sequence-structure homology recognition using environment-specific substitution tables and structure-dependent gap penalties J Mol Biol 310 2001 243 257
22. W.R. Taylor, and C.A. Orengo Protein structure alignment J Mol Biol 208 1989 1 22
23. K. Karplus, and B. Hu Evaluation of protein multiple alignments by SAM-T99 using the BAliBASE multiple alignment test set Bioinformatics 17 2001 713 720
24. M.A. McClure, T.K. Vasi, and W.M. Fitch Comparative analysis of multiple protein-sequence alignment methods Mol Biol Evol 11 1994 571 592
25. J.D. Thompson, F. Plewniak, and O. Poch A comprehensive comparison of multiple sequence alignment programs J Mol Biol 27 1999 2682 2690
26. K. Mizuguchi, C.M. Deane, T.L. Blundell, and J.P. Overington HOMSTRAD: a database of protein structure alignments for homologous families Protein Sci 7 1998 2469 2471
27. R.C. Edgar MUSCLE: multiple sequence alignment with high accuracy and high throughput Nucleic Acids Res 32 2004 1792 1797 MUSCLE is faster than Clustal and as accurate as T-Coffee, making it a very slick and useful piece of work.
28. I.V. Walle, I. Lasters, and L. Wyns SABmark - a benchmark for sequence alignment that covers the entire known fold space Bioinformatics 2004 doi:10.1093/bioinformatics/bth493
29. A.R. Subramanian, J. Weyer-Menkhoff, M. Kaufmann, and B. Morgenstern DIALIGN-T: an improved algorithm for segment-based multiple sequence alignment BMC Bioinformatics 6 2005 66
30. J. Stoye, D. Evers, and F. Meyer Rose: generating sequence families Bioinformatics 14 1998 157 163
31. O. O'Sullivan, M. Zehnder, D. Higgins, P. Bucher, A. Grosdidier, and C. Notredame APDB: a novel measure for benchmarking sequence alignment methods without reference alignments Bioinformatics 19 suppl 1 2003 i215 i221
32. K. Katoh, K.I. Kuma, H. Toh, and T. Miyata MAFFT version 5: improvement in accuracy of multiple sequence alignment Nucleic Acids Res 33 2005 511 518 This paper describes the latest improvements to the very fast and accurate MAFFT programs.
33. K. Katoh, K. Misawa, K. Kuma, and T. Miyata MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform Nucleic Acids Res 30 2002 3059 3066
34. W.R. Pearson, and D.J. Lipman Improved tools for biological sequence comparison Proc Natl Acad Sci USA 85 1988 2444 2448
35. T.F. Smith, and M.S. Waterman Identification of common molecular subsequences J Mol Biol 147 1981 195 197
36. R.I. Sadreyev, and N.V. Grishin Quality of alignment comparison by COMPASS improves with inclusion of diverse confident homologs Bioinformatics 20 2004 818 828
37. V.A. Simossis, J. Kleinjung, and J. Heringa Homology-extended sequence alignment Nucleic Acids Res 33 2005 816 824 The authors show how the multiple sequence alignment program PRALINE can now include information obtained from database searches to dramatically improve the quality of an alignment.
38. I. Holmes, and R. Durbin Dynamic programming alignment accuracy J Comput Biol 5 1998 493 504
39. R.C. Edgar MUSCLE: a multiple sequence alignment method with reduced time and space complexity BMC Bioinformatics 5 2004 113 The algorithms used in the new MUSCLE program are described in detail in this paper.
40. R.C. Edgar Local homology recognition and distance measures in linear time using compressed amino acid alphabets Nucleic Acids Res 32 2004 380 385
41. van Ohsen N, Zimmer R: Improving profile-profile alignments via log average scoring. In Algorithms in Bioinformatics, First International Workshop, WABI 2001; Aarhus, Denmark, August 28-31, 2001. Lecture Notes In Computer Science, vol 2149. Edited by Gascuel O, Moret BME. Springer; 2001:11-26.
42. N. Bray, and L. Pachter MAVID: constrained ancestral alignment of multiple sequences Genome Res 14 2004 693 699
43. M. Brudno, M. Chapman, B. Gottgens, S. Batzoglou, and B. Morgenstern Fast and sensitive multiple alignment of large genomic sequences BMC Bioinformatics 4 2003 66
44. M. Brudno, C.B. Do, G.M. Cooper, M.F. Kim, E. Davydov, E.D. Green, A. Sidow, and S. Batzoglou LAGAN and multi-LAGAN: efficient tools for large-scale multiple alignment of genomic DNA Genome Res 13 2003 721 731
45. S. Sinha, M. Blanchette, and M. Tompa PhyME: a probabilistic algorithm for finding motifs in sets of orthologous sequences BMC Bioinformatics 5 2004 170
46. M.C. Frith, U. Hansen, J.L. Spouge, and Z. Weng Finding functional sequence elements by multiple local alignment Nucleic Acids Res 32 2004 189 200
47. T.L. Bailey, and C. Elkan Fitting a mixture model by expectation maximization to discover motifs in biopolymers Proc Int Conf Intell Syst Mol Biol 2 1994 28 36
48. Y. Zhang, and M.S. Waterman An Eulerian path approach to local multiple alignment for DNA sequences Proc Natl Acad Sci USA 102 2005 1285 1290