Taxonomy with confidence

doi:10.1016/0025-5564(78)90089-5

Mathematical Biosciences

Volume 40, Issues 3–4, August 1978, Pages 271-280

https://doi.org/10.1016/0025-5564(78)90089-5 Get rights and content

Abstract

There are essentially three ways in which four species may be related in a phylogenetic tree graph. It is usual to compute for each of these three possibilities the smallest number of mutations that could have brought about the observed distribution of characteristics among the four species. The graph that minimizes this number is then preferred. In fact, the hypothesis that the graph chosen in this way is correct may be accepted with confidence if the minimum is strong in a sense described here. In principle, the theory could be extended to treat sets of more than four species.

References (10)

J.H. Camin et al.
A method for deducing branching sequences in phylogeny
Evolution
(1965)
G.F. Estabrook
Cladistic methodology: a discussion of the theoretical basis for the induction of evolutionary history
Annual Review of Ecology and Systematics
(1972)
J.S. Farris
A probability model for inferring evolutionary trees
Syst. Zool.
(1973)
J.S. Farris
Estimation of number of amino acid substitutions when back mutations can occur
Amer. Naturalist
(1973)
W. Feller
(1968)

There are more references available in the full text version of this article.

Cited by (151)

Comparing evolutionary distances via adaptive distance functions
2018, Journal of Theoretical Biology
Citation Excerpt :
The standard distance function suggested for this model by Kimura (1980) estimates the total number of substitutions along a given evolutionary path. However, for very long evolutionary paths, in which saturation of transitions leads to noisy estimates of their counts, it is common practice to count only transversions using a formula from Cavender (1978); Farris (1973); Neymann (1971). Both formulas are valid for the purpose of phylogenetic reconstruction because they estimate additive substitution counts under the K2P model (all substitutions versus only transversions).
Distance-based methods for phylogenetic reconstruction are based on a two-step approach: first, pairwise distances are computed from DNA sequences associated with a given set of taxa, and then these distances are used to reconstruct the phylogenetic relationships between taxa. Because the estimated distances are based on finite sequences, they are inherently noisy, and this noise may result in reconstruction errors. Previous attempts to improve reconstruction accuracy focused either on improving the robustness of reconstruction algorithms to this stochastic noise, or on improving the accuracy of the distance estimates. Here, we aim to further improve reconstruction accuracy by utilizing the basic observation that reconstruction algorithms are based on a series of comparisons between distances (or linear combinations of distances). We start by examining the relationship between the stochastic noise in the sequence data and the accuracy of the comparisons between pairwise distance estimates. This examination results in improved methods for distance comparison, which are shown to be as accurate as likelihood-based methods, while being much simpler and more efficient to compute. We then extend these methods to improve reconstruction accuracy of quartet trees, and examine some of the challenges moving forward.
Molecular phylogenetics
2018, Encyclopedia of Bioinformatics and Computational Biology: ABC of Bioinformatics
This article gives a brief overview of the assumptions, methods and challenges associated with estimating phylogenetic relationships from biomolecular data such as DNA sequences. It is intended as an introduction to the topic of molecular phylogenetics, which itself is the topic of several textbooks and journals. The article first motivates the estimation of molecular phylogenies, then discusses the basic approach to it, from acquisition and preparation of data via sequence alignment, through a survey of the common assumptions that are made in order to make the problem practicable, and then a discussion of two of the main methods used when searching for optimal trees: maximum parsimony and maximum likelihood. An outline is then provided of the problem of searching tree space, and how Bayesian methods and Markov chain Monte Carlo are now a central tool in molecular phylogenetics. The article finishes with some caveats and suggested further reading.
Theoretical guarantees for phylogeny inference from single-cell lineage tracing
2023, Proceedings of the National Academy of Sciences of the United States of America
AN IMPOSSIBILITY RESULT FOR PHYLOGENY RECONSTRUCTION FROM k-MER COUNTS
2022, Annals of Applied Probability
Gibbs measures in biology and physics: The Potts model
2022, Gibbs Measures in Biology and Physics: The Potts Model
A cladistic approach to the evolution of steppe scripts
2022, International Journal of Intelligent Engineering Informatics

View all citing articles on Scopus

View full text

Taxonomy with confidence

Abstract

A method for deducing branching sequences in phylogeny

Evolution

Cladistic methodology: a discussion of the theoretical basis for the induction of evolutionary history

Annual Review of Ecology and Systematics

A probability model for inferring evolutionary trees

Syst. Zool.

Estimation of number of amino acid substitutions when back mutations can occur

Amer. Naturalist