Maximum Parsimony¶
Select the branching tree that minimizes the total character-state-change cost needed to explain observed leaf states under a stated scoring model.
Core Idea¶
Maximum parsimony selects a branching tree by minimizing the character-state changes needed to explain observations at its leaves. For each candidate tree, internal states are assigned to obtain the lowest score under a stated change-cost rule. The tree or tied trees with the lowest resulting score are preferred. Scoring one fixed tree is small parsimony; comparing candidate topologies is the additional maximum-parsimony step.[^ref-c02bd0a3a0c7]
Scope of Application¶
In evolutionary reconstruction, observed species or sequences supply the leaves and nucleotide or morphological traits supply characters. In textual criticism, manuscript witnesses can be leaves and variant readings characters; a study of Acts 5 encoded 54 manuscripts at 279 variation places and applied the same tree criterion. These are literal uses of one scoring pattern, though neither guarantees a true tree-like history.[ref-c02bd0a3a0c7][ref-931547742fb1]
Clarity¶
“Fewest changes” is incomplete until characters and transition costs are declared. Equal-cost Fitch scoring is one case; weighted or asymmetric scoring can change the preferred tree and, for asymmetric changes, make rooting relevant. A low score does not by itself show that an inferred history is true.[ref-c02bd0a3a0c7][ref-17f00d892bb2]
Manages Complexity¶
The method reduces many possible ancestral-state assignments to a score for each topology, then ranks those topologies consistently. It does not remove the difficulty of exploring a large tree space or the need to check whether the coding and tree assumption suit the evidence.[^ref-c02bd0a3a0c7]
Abstract Reasoning¶
Specify the same leaf data and cost model for competing trees, minimize internal assignments on each, then compare totals. Distinguish a globally proven minimum from the best tree visited by a heuristic. The staged parent is live Optimization; broad Occam-style parsimony is related but lacks this explicit character-change objective.[^ref-c02bd0a3a0c7]
Knowledge Transfer¶
Biological taxa and textual witnesses are different objects, yet both can fill the character, tree, change-cost and minimum-selection roles. Outside character-coded tree reconstruction, the general optimization idea transfers, but the named MP criterion does not automatically apply.[ref-c02bd0a3a0c7][ref-931547742fb1]
[^ref-c02bd0a3a0c7]: Amir Carmel, Noa Musa-Lempel, Dekel Tsur and Michal Ziv-Ukelson, "The Worst Case Complexity of Maximum Parsimony", Journal of Computational Biology 21(11), 799–808 (2014), §1.1. [^ref-931547742fb1]: Pasi Hyytiäinen, "The Changing Text of Acts: A Phylogenetic Approach", TC: A Journal of Biblical Textual Criticism 26 (2021), PDF pp. 13–18. [^ref-17f00d892bb2]: Joseph Felsenstein, "Cases in Which Parsimony or Compatibility Methods Will Be Positively Misleading", Systematic Zoology 27(4), 401–410 (1978), publisher abstract.
Relationships to Other Abstractions¶
Current abstraction Maximum Parsimony Domain-specific
Parents (1) — more general patterns this builds on
-
Maximum Parsimony is a kind of Optimization Prime
Maximum parsimony minimizes an explicit character-change objective over candidate trees.
Hierarchy path (1) — routes to 1 parentless root
- Maximum Parsimony → Optimization
Neighborhood in Abstraction Space¶
Maximum Parsimony sits in a sparse region of the domain-specific corpus (79th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Codes, Matrices & Combinatorial Problems (30 abstractions)
Nearest neighbors
- Optimality criterion — 0.84
- Branch Decomposition — 0.83
- Suffix Tree — 0.82
- De Novo Transcriptome Assembly — 0.82
- Phylogenetic nomenclature — 0.82
Computed from structural-signature embeddings · 2026-10-08