Abstract
Several approaches to the multiple alignment problem are conceivable, but virtually all are based on the Parsimony Principle: Choose the history of a set of sequences that minimizes the overall amount of change (insertion-deletions and substitutions/mutations). This formulation was first presented by Sankoff (1) together with a dynamic programming algorithm solving the problem. However, this was so slow that all programs in use have opted for heuristic, but much faster algorithms, and so has TreeAlign. Given the large growth in the data involving sets of homologous sequences, a good solution to this problem has high priority.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Sankoff, D., Morel, C, and Cedergren, R. J. (1973) Evolution of 5S RNA and the non-randomness of base replacements. Nature New Biology 245,232–234.
Felsenstein, J (1981) Evolutionary trees from DNA sequences: a maximum likelihood approach J Mol. Evol. 17, 368–376.
Felsenstein, J. (1985) Confidence limits on phylogenies an approach using the bootstrap. Evolution 39, 16–24.
Thome, J. L., Kishino, H., and Felsenstein, J. (1991) An evolutionary model for maximum likelihood alignment of DNA sequences. J. Mol. Evol 33, 114–124.
Kececioglu, J. (1991) Exact and approximate algorithms for the DNA sequence reconstruction problem. Ph.D. Computer Science. Tucson, AZ.
Sankoff, D (1972) Matching sequences under deletion/insertion constraints. Proc Natl Acad Sci. USA 69, 4–6.
Hein, J. J. (1989a) A new method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous sequences, when the phylogeny is given. Mol. Biol. Evol. 6.6, 669–684
Hardison, S. P. and Steele, G.L. (1987) C: A Reference Manual (2nd ed.) Prentice-Hall, Englewood Cliffs, NJ
Felsenstein, J. (1988) PHYLIP Phylogeny Inference Package version 3.2 Cladistics 5, 164–166.
Hein, J. J. (1990) A unified approach to alignment and phylogenies. Methods Enzymol. 183, 626–645.
McCreight, E. M. (1976) A space-economical suffix tree construction algorithm. J. Ass. Comp. Mach. 13.1, 262–272.
Blumer, A., Blumer, J., Haussler, D, and McConnell, R., (1987) Complete inverted files for efficient text retrieval and analysis. J. Ass. Comp. Mach 34.3, 578–595.
Karlin, S. and Ost, F. (1985) Maximal segmental match among random sequences from a finite alphabet Proceedings of the Berkeley Conference in Honor of J. Neyman and J. Kiefer, 225–243
Arratia, R. and Waterman, M. (1985) An Erdos-Renyi law with shifts. Adv. Math. 55, 13–23
Felsenstein, J (1981) A likelihood approach to character weighting and what it tells us about parsimony and compatibility. Biol. J. Linn. Soc. 16, 183–196.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Human Press Inc, Totowa, NJ
About this protocol
Cite this protocol
Hein, J. (1994). TreeAlign. In: Computer Analysis of Sequence Data. Methods in Molecular Biology, vol 25. Springer, Totowa, NJ. https://doi.org/10.1385/0-89603-276-0:349
Download citation
DOI: https://doi.org/10.1385/0-89603-276-0:349
Publisher Name: Springer, Totowa, NJ
Print ISBN: 978-0-89603-276-7
Online ISBN: 978-1-59259-512-9
eBook Packages: Springer Protocols