The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Minimum Mutation Fits to a Given Tree
Abstract
SUMMARY A number of objects, such as species, lie at the ends of a known evolutionary tree. A variable taking a finite number of possible values is specified on this set of objects. How can the values of the variable be estimated for the ancestors of the objects? One way is to assign to the ancestors those values which have the number of mutations (or changes) in going from ancestors to their immediate descendants. In this paper, a method of generating all such fits is described. An evolutionary model for a set of objects is a family tree of possibly hypothetical ancestors through which each object may be traced back to the same primordial ancestor. Evolutionary models are used in the classification of plant and animal life, languages, motor cars, cultures, religions. The construction of the family tree is a difficult problem requiring synthesis of many types of knowledge. Suppose that the family tree is given, and that a variable V (such as number of limbs, for animals) is given for the set of objects (such as species, or families) at the ends of the tree. What values will V take for the hypothetical ancestors? A complete answer to this question is a probability distribution over the set of all possible values that the ancestors might take. A more modest answer is to assign values of V to the ancestors in such a way that the number of changes in V occur, between ancestors and their immediate descendants. This minimum mutation fit is most likely under some reasonable probability models, but seems compelling in its own right. It is the assignment which permits representation of the data in a number of symbols. Camin and Sokal [1965] consider the problem Qf finding an evolutionary tree when each variable has an ordered set of values, and can only take place from a lower to a higher value. Estabrook [1968] extends this structure on the values of the variable to be a partial order with tree structure-for each variable, an evolutionary tree is known connecting the values. In both of these formulations, the fit to a given tree is not a serious problem. The optimal value for an ancestor is always the most primitive value in its descendants. Cavalli-Sforza and Edwards [1967] consider fits 53
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology
Fitch, W. M. (1971) · Systematic Biology · doi:10.1093/sysbio/20.4.406 · Cited by 6,492
Phylogenetic analysis: models and estimation procedures
(2018) · Phylogenetic Inference, Selection Theory, and History of Science · doi:10.1017/9781316276259.010 · Cited by 2,260
Methods for Computing Wagner Trees
Farris, J. S. (1970) · Systematic Biology · doi:10.1093/sysbio/19.1.83 · Cited by 1,222
general textbook of entomology
Imms, A. D. (1957) · Cited by 669
Cited by
The neighbor-joining method: a new method for reconstructing phylogenetic trees.
(1987) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040454 · Cited by 59,715
PAML 4: Phylogenetic Analysis by Maximum Likelihood
Yang, Z. (2007) · Molecular Biology and Evolution · doi:10.1093/molbev/msm088 · Cited by 13,879
Outgroup Analysis and Parsimony
Maddison, W. P., Donoghue, M. J., & Maddison, D. R. (1984) · Systematic Biology · doi:10.1093/sysbio/33.1.83 · Cited by 982
Maddison, W. P. (1990) · Evolution · doi:10.1111/j.1558-5646.1990.tb05937.x · Cited by 533
Phylogenetic tree building in the genomic age
Kapli, P., Yang, Z., & Telford, M. J. (2020) · Nature Reviews Genetics · doi:10.1038/s41576-020-0233-0 · Cited by 533
Metadata
- Authors
- Hartigan, J. A.
- Venue
- Biometrics
- Publisher
- JSTOR
- Published
- 1973-03
- Volume
- 29
- Issue
- 1
- Pages
- 53
- ISSN
- 0006-341X (ISSN-L)
- OpenAlex
- W1968248848
- Cited by
- 271
- References
- 4
- FWCI
- 2.30
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Minimum Mutation Fits to a Given Tree. https://app.cochat.ai/papers/10.2307/2529676
- The paper
- Hartigan, J. A. (1973). Minimum Mutation Fits to a Given Tree. Biometrics. https://doi.org/10.2307/2529676
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.