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
Preview
Unable to display preview. Download preview PDF.
11.6 Bibliographic Notes
J. P. Barthelemy and A. Guenoche: Trees and Proximity Representations. Wiley, 1991.
V. Berry, D. Bryant, T. Jiang, P. Kearney, M. Li, T. Wareham, and H. Zhang: A practical algorithm for recovering the best supported edges of an evolutionary tree. Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’00), 2000, pp. 287–296.
P. Buneman: The recovery of trees from measures of dissimilarity. In: F. R. Hodson, D. G. Kendall, and P. Tautu (eds.): Mathematics in the Archaeological and Historical Sciences, Edinburgh University Press, 1971, pp. 387–395.
P. Clote and R. Backofen: Computational Molecular Biology — An Introduction. Wiley, 2000.
R. Durbin, S. Eddy, A. Krogh, and G. Mitchinson: Biological Sequence Analysis — Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, 1998.
W. J. Ewens and G. R. Grant: Statistical Methods in Bioinformatics — An Introduction. Springer, 2002.
M. Farach, S. Kannan, and T. Warnow: A robust model for finding optimal evolutionary trees. Algorithmica 13, 1995, pp. 155–179.
J. Felsenstein: Evolutionary trees from DNA sequences: A maximum likelihood approach. Journal of Molecular Evolution 17, 1981, pp. 368–378.
J. Felsenstein: Statistical inference of phylogenies. Journal of the Royal Statistical Society A 146(3), pp. 246–272.
W. M. Fitch: Toward defining the course of evolution: minimum change for a specified tree topology. Systematic Zoology 20, 1971, 406–416.
W. M. Fitch and E. Margoliash: The construction of phylogenetic trees. Science 155, 1967, pp. 279–284.
D. Gusfield: Efficient algorithms for inferring evolutionary trees. Networks 21, 1991, pp. 19–28.
D. Gusfield: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
T. Jiang, P. Kearney, and M. Li: Orchestrating quartets: approximation and data correction. Proceedings of the 39th IEEE Symposium on Foundations of Computer Science (FOCS’98), 1998, pp. 416–425.
P. Kearney: Phylogenetics and the quartet method. In: T. Jiang, Y. Xu, and M. Q. Zhang (eds.): Current Topics in Computational Molecular Biology, MIT Press, 2002, pp. 111–133.
E. Schröder: Vier combinatorische Probleme. Zeitschrift für Mathematik und Physik 15, 1870, pp. 361–376.
C. Semple and M. Steel: Phylogenetics. Oxford University Press, 2003.
J. Setubal and J. Meidanis: Introduction to Computational Molecular Biology. PWS Publishing Company, 1997.
R. R. Sokal and C. D. Michener: A statistical method for evaluating systematic relationships. University of Kansas Scientific Bulletin 28, 1958, pp. 1409–1438.
K. Strimmer and A. von Haeseler: Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies. Molecular Biology and Evolution 13(7), 1996, pp. 964–969.
D. L. Swofford and G. J. Olsen: Phylogeny reconstruction. In: D. M. Hillis and C. Moritz (eds.): Molecular Systematics, Sinauer Associates, 1990, pp. 411–501.
M. S. Waterman: Introduction to Computational Biology — Maps, Sequences and Genomes. Chapman & Hall/CRC, 1995.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Phylogenetic Trees. In: Algorithmic Aspects of Bioinformatics. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71913-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-71913-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71912-0
Online ISBN: 978-3-540-71913-7
eBook Packages: Computer ScienceComputer Science (R0)