Reticular alignment: A progressive corner-cutting method for multiple sequence alignment

BMC Bioinformatics

Volumn 11, Issue , 2010, Pages

  Szabó, Adrienn ^a,b   Novák, Ádám ^c   Miklós, István ^a   Hein, Jotun ^c  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ACCURACY MEASUREMENTS; ALIGNMENT METHODS; MULTIPLE ALIGNMENT; MULTIPLE SEQUENCE ALIGNMENTS; PROGRESSIVE ALIGNMENT; SEARCH STRATEGIES; SEARCHING STRATEGY; THRESHOLD PARAMETERS;

AMINO ACIDS; SPAMMING;

SOFTWARE TESTING;

ALGORITHM; ARTICLE; COMPUTER PROGRAM; FACTUAL DATABASE; METHODOLOGY; SEQUENCE ALIGNMENT;

ALGORITHMS; DATABASES, FACTUAL; SEQUENCE ALIGNMENT; SOFTWARE;

EID: 78549270123     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-11-570     Document Type: Article

References (32)

1. Gusfield D. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology 1997, Cambridge University Press.
2. Needleman SB, Wunsch CD. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol 1970, 48(3):443-53. 10.1016/0022-2836(70)90057-4, 5420325.
3. Sankoff D, Cedergren RJ. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison 1983, 253-263. Addison-Wesley, Reading, Massachusetts, chap. Simultaneous comparison of three or more sequences related by a tree.
4. Wang L, Jiang T. On the complexity of multiple sequence alignment. J Comp Biol 1994, 1(4):337-348.
5. Fickett J. Fast optimal alignment. Nucleic Acids Research 1984, 12:175-180. 10.1093/nar/12.1Part1.175, 320994, 6694900.
6. Ukkonnen E. Algorithms for approximate string matching. Inform Control 1985, 64:100-118.
7. Spouge J. Fast optimal alignment. CABIOS 1991, 7:1-7.
8. Hein J, Wiuf C, Knudsen B, Moller MB, Wibling G. Statistical alignment: computational properties, homology testing and goodness-of-fit. J Mol Biol 2000, 302:265-279. 10.1006/jmbi.2000.4061, 10964574.
9. Wu S, Manber U, Myers G, Miller W. An O(NP) sequence comparison algorithm. Information Processing Letters 1990, 35(6):317-323.
10. Carrillo H, Lipman D. The multiple sequence alignment problem in biology. SIAM Journal of Applied Mathematics 1988, 48:1073-1082.
11. Lipman D, Altschul S, Kececioglu J. A tool for multiple sequence alignment. PNAS 1989, 86:4412-4415. 10.1073/pnas.86.12.4412, 287279, 2734293.
12. Gupta S, Kececioglu J, Schäffer A. Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment. J Comp Biol 1995, 2(3):459-472.
13. Hogeweg P, Hesper B. The alignment of sets of sequences and the construction of phyletic trees: An integrated method. J Mol Evol 1984, 20(2):175-186. 10.1007/BF02257378, 6433036.
14. Feng DF, Doolittle RF. Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J Mol Evol 1987, (25):351-360. 10.1007/BF02603120, 3118049.
15. Higgins D, Sharp P. CLUSTAL: a package for performing multiple sequence alignment on a microcomputer. Gene 1988, 73:237-44. 10.1016/0378-1119(88)90330-7, 3243435.
16. Thompson J, Higgins D, Gibson T. ClustalW: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucl Acids Res 1994, 22:4673-4690. 10.1093/nar/22.22.4673, 308517, 7984417.
17. Notredame C, Higgins D, Heringa J. T-Coffee: A novel method for fast and accurate multiple sequence alignment. J Mol Biol 2000, 302:205-17. 10.1006/jmbi.2000.4042, 10964570.
18. Katoh K, Misawa K, Kuma K, Miyata T. MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucl Acids Res 2002, 30(14):3059-3066. 10.1093/nar/gkf436, 135756, 12136088.
19. Suchard MA, Redelings BD. BAli-Phy: Simultaneous Bayesian inference of alignment and phylogeny. Bioinformatics 2006, 22(16):2047-2048. 10.1093/bioinformatics/btl175, 16679334.
20. Novák A, Miklós I, Lyngsø R, Hein J. StatAlign: An Extendable Software Package for Joint Bayesian Estimation of Alignments and Evolutionary Trees. Bioinformatics 2008, 24(20):2403-2404. 10.1093/bioinformatics/btn457, 18753153.
21. Bradley R, Roberts A, Smoot M, Juvekar S, Do J, Dewey C, Holmes I, Pachter L. Fast Statistical Alignment. PLoS Computational Biology 2009, 5:e1000392. 10.1371/journal.pcbi.1000392, 2684580, 19478997.
22. Zhu J, Liu J, Lawrence C. Bayesian adaptive sequence alignment algorithms. Bioinformatics 1998, 14:25-39. 10.1093/bioinformatics/14.1.25, 9520499.
23. Thompson J, Koehl P, Ripp R, O P. BAliBASE 3.0: latest developments of the multiple sequence alignment benchmark. Proteins 2005, 61:127-136. 10.1002/prot.20527, 16044462.
24. Waterman MS, Byers TH. A dynamic programming algorithm to find all solutions in the neighborhood of the optimum. Math Biosci 1985, 77:179-188.
25. Saitou N, Nei M. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol Biol Evol 1987, 4(4):406-425.
26. Studier J, Keppler K. A note on the Neighbor-Joining algorithm of Saitou and Nei. Mol Biol Evol 1988, 5(6):729-731.
27. Hirschberg DS. A linear space algorithm for computing maximal common subsequences. Commun ACM 1975, 18(6):341-343.
28. Ma B, Wang Z, Zhang K. Alignment between Two Multiple Alignments. Lecture Notes in Computer Science 2003, 2676:254-265.
29. Henikoff S, Henikoff J. Amino acid substitution matrices from protein blocks. Proc Natl Acad Sci USA 1992, 89(22):10915-10919. 10.1073/pnas.89.22.10915, 50453, 1438297.
30. Durbin R, Eddy S, Krogh A, Mitchison G. Biological sequence analysis. Probabilistic models of proteins and nucleic acids 1998, Cambridge University Press.
31. Tarnas C, Hughey R. Reduced space hidden Markov model training. Bioinformatics 1998, 14:401-406. 10.1093/bioinformatics/14.5.401, 9682053.
32. Kececioglu J, Kim E. Simple and Fast Inverse Alignment. Lecture Notes in Computer Science 2006, 3909:441-455.