The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
On the Problem of Discovering the Most Parsimonious Tree
Abstract
The problem of discovering the most parsimonious tree is defined in terms of a set of linearly arrayed sequences. Simplifications are introduced to reduce the total amount of work including the elimination of uninformative positions and the recognition of equivalent positions. The procedure can be applied to any array of sequences, including amino acid. It is shown, however, that failure to convert such sequences, through the genetic code, into nucleotide sequences is very wasteful of pertinent information. Parsimony is shown as a procedure that minimizes discordancies (parallel and]or back substitutions). A procedure (a discordancy diagram) is given that enables one to recognize when two characters (nucleotide positions) will necessitate the acceptance of such discordancies and how many, at least, will be unavoidable. Subtraction of these unavoidable discordancies from a matrix of potential discordancies leads to a matrix of avoidable discordancies that generally give at least two pairs of taxa that are most closely related parsimoniously (i.e., zero avoidable discordancies) and may therefore be replaced by an ancestral form determined by the parsimony process. The parsimony process is also given. The process may be repetitively performed until the tree is completed. A method of determining a lower bound to the number of substitutions required is given that gives a much larger lower bound than previous estimates. A quick estimate of the upper bound is also provided. An alternative approach, using a Prim-Kruskal network (minimal spanning tree) on the avoidable discordancy distances, is given together with a procedure for interpreting such networks in terms of a phylogeny that appears more natural than the dendrograms usually employed in the interpretation of singlelinkage diagrams. The reduction of a strictly bifurcating tree to a Prim-Kruskal network is called compression and its reverse is called decompression with the original tree being recovered after a complete cycle of the two processes. There is a unique one-to-one correspondence between any phylogenetic tree and its compressed network form. The compressed form can be the basis for an unambiguous linear representation of a tree that is more compact than that of any other known method of representation.
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
Harary, F. (1969) · Cited by 10,739
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
Self-citationOn the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Shortest Connection Networks And Some Generalizations
Prim, R. C. (1957) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb01515.x · Cited by 4,565
Atlas of protein sequence and structure
Chang, M.-Y., Dayhoff, M. O., Eck, R. V., & Sochard, M. R. (1965) · NASA Technical Reports Server (NASA) · Cited by 4,383
Quantitative Phyletics and the Evolution of Anurans
Kluge, A. G., & Farris, J. S. (1969) · Systematic Biology · doi:10.1093/sysbio/18.1.1 · Cited by 2,855
Maximum matching and a polyhedron with 0,1-vertices
Edmonds, J. (1965) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.069b.013 · Cited by 1,712
A METHOD FOR DEDUCING BRANCHING SEQUENCES IN PHYLOGENY
Camin, J. H., & Sokal, R. R. (1965) · Evolution · doi:10.1111/j.1558-5646.1965.tb01722.x · Cited by 808
Dreyfus, S. E., & Wagner, R. A. (1971) · Networks · doi:10.1002/net.3230010302 · Cited by 696
Felsenstein, J. (1973) · Systematic Biology · doi:10.1093/sysbio/22.3.240 · Cited by 627
Cited by
Progressive sequence alignment as a prerequisitetto correct phylogenetic trees
Feng, D.-F., & Doolittle, R. F. (1987) · Journal of Molecular Evolution · doi:10.1007/bf02603120 · Cited by 1,883
Evaluating the Effects of SARS-CoV-2 Spike Mutation D614G on Transmissibility and Pathogenicity
Volz, E., Hill, V., McCrone, J. T., Price, A., Jorgensen, D., O’Toole, Á., Southgate, J., Johnson, R., Jackson, B., Nascimento, F. F., et al. (2021) · Cell · doi:10.1016/j.cell.2020.11.020 · Cited by 1,006
Mitochondrial portraits of human populations using median networks.
Bandelt, H. J., Forster, P., Sykes, B. C., & Richards, M. B. (1995) · Genetics · doi:10.1093/genetics/141.2.743 · Cited by 1,073
Hwang, F. K., & Richards, D. S. (1992) · Networks · doi:10.1002/net.3230220105 · Cited by 663
Goodman, M., Czelusniak, J., Moore, G. W., Romero-Herrera, A. E., & Matsuda, G. (1979) · Systematic Biology · doi:10.1093/sysbio/28.2.132 · Cited by 566
Branch and bound algorithms to determine minimal evolutionary trees
Hendy, M. D., & Penny, D. (1982) · Mathematical Biosciences · doi:10.1016/0025-5564(82)90027-x · Cited by 531
Tomitani, A., Knoll, A. H., Cavanaugh, C. M., & Ohno, T. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0600999103 · Cited by 469
Ehlting, J., Büttner, D., Wang, Q., Douglas, C. J., Somssich, I. E., & Kombrink, E. (1999) · The Plant Journal · doi:10.1046/j.1365-313x.1999.00491.x · Cited by 467
A rate-independent technique for analysis of nucleic acid sequences: evolutionary parsimony.
(1987) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040433 · Cited by 377
Approximating the coalescent with recombination
McVean, G. A. T., & Cardin, N. J. (2005) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2005.1673 · Cited by 366
[23] Progressive alignment and phylogenetic tree construction of protein sequences
Feng, D.-F., & Doolittle, R. F. (1990) · Methods in Enzymology · doi:10.1016/0076-6879(90)83025-5 · Cited by 348
Comparative and functional genomics of closteroviruses
Dolja, V. V., Kreuze, J. F., & Valkonen, J. P. T. (2006) · Virus Research · doi:10.1016/j.virusres.2006.02.002 · Cited by 343
Evidence that eukaryotes and eocyte prokaryotes are immediate relatives
Rivera, M. C., & Lake, J. A. (1992) · Science · doi:10.1126/science.1621096 · Cited by 341
Origin of the eukaryotic nucleus determined by rate-invariant analysis of rRNA sequences
Lake, J. A. (1988) · Nature · doi:10.1038/331184a0 · Cited by 320
Rapid Evolution of NK Cell Receptor Systems Demonstrated by Comparison of Chimpanzees and Humans
Khakoo, S. I., Rajalingam, R., Shum, B. P., Weidenbach, K., Flodin, L., Muir, D. G., Canavez, F., Cooper, S. L., Valiante, N. M., Lanier, L. L., et al. (2000) · Immunity · doi:10.1016/s1074-7613(00)80219-8 · Cited by 277
Hamberger, B., & Hahlbrock, K. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307307101 · Cited by 261
Dinoflagellates in evolution. A molecular phylogenetic analysis of large subunit ribosomal RNA
Lenaers, G., Maroteaux, L., Michot, B., & Herzog, M. (1989) · Journal of Molecular Evolution · doi:10.1007/bf02106180 · Cited by 261
Penny, D., Foulds, L. R., & Hendy, M. D. (1982) · Nature · doi:10.1038/297197a0 · Cited by 213
Leite, T. S., Haimovici, M., Molina, W., & Warnke, K. (2008) · Journal of Molluscan Studies · doi:10.1093/mollus/eym050 · Cited by 137
Evolution of the mammalian beta-globin gene cluster.
Hardies, S. C., Edgell, M. H., & Hutchison, C. A. (1984) · Journal of Biological Chemistry · doi:10.1016/s0021-9258(17)43158-9 · Cited by 78
Metadata
- Authors
- Fitch, W. M.
- Venue
- The American Naturalist
- Publisher
- University of Chicago Press
- Published
- 1977-03
- Volume
- 111
- Issue
- 978
- Pages
- 223-257
- ISSN
- 0003-0147 (ISSN-L)
- 1537-5323
- OpenAlex
- W2073868508
- Cited by
- 357
- References
- 15
- FWCI
- 1.76
- 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
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.