Abstract
The problem of finding minimal phylogenetic trees for reasonably sized data sets is hampered by the very large amount of computation required. In this note we consider some new techniques developed to enable researchers to analyse such trees on larger data sets. The basic principle involved is to split the problem into a number of smaller problems which can be more easily handled. Much of the work is described in graph theoretic terms, but no deep results of graph theory are called upon.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M.O. Dayhoff, Atlas of Protein Sequence and Structure 5 (National Biomedical Research Foundation, Silver Spring, Maryland).
L.R. Foulds, M.D. Hendy, David Penny, A Graph Theoretic Approach to the Development of Minimal Phylogenetic Trees, J. Mol. Evol. 13 (1979), 127–150.
L.R. Foulds, David Penny, M.D. Hendy, A General Approach to Proving the Minimality of Phylogenetic Trees Illustrated by an Example with a Set of 23 Vertebrates, J. Mol. Evol. 13 (1979), 151–166.
David Penny, M.D. Hendy, L.R. Foulds, Techniques for the verification of Minimal Phylogenetic Trees Illustrated with 10 Mammalian Hemoglobin Sequences (to appear).
R.W. Robinson, L.R. Foulds, Determining the Asymptotic Number of Phylogenetic Trees, These Proceedings.
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag
About this paper
Cite this paper
Hendy, M.D. (1980). Establishing the minimality of phylogenetic trees from protein sequences. In: Robinson, R.W., Southern, G.W., Wallis, W.D. (eds) Combinatorial Mathematics VII. Lecture Notes in Mathematics, vol 829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0088910
Download citation
DOI: https://doi.org/10.1007/BFb0088910
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10254-0
Online ISBN: 978-3-540-38376-5
eBook Packages: Springer Book Archive