The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Relative efficiencies of the maximum parsimony and distance-matrix methods in obtaining the correct phylogenetic tree.
Open accessAbstract
The relative efficiencies of the maximum parsimony (MP) and distance-matrix methods in obtaining the correct tree (topology) were studied by using computer simulation. The distance-matrix methods examined are the neighbor-joining, distance-Wagner, Tateno et al. modified Farris, Faith, and Li methods. In the computer simulation, six or eight DNA sequences were assumed to evolve following a given model tree, and the evolutionary changes of the sequences were followed. Both constant and varying rates of nucleotide substitution were considered. From the sequences thus obtained, phylogenetic trees were constructed using the six tree-making methods and compared with the model (true) tree. This process was repeated 300 times for each different set of parameters. The results obtained indicate that when the number of nucleotide substitutions per site is small and a relatively small number of nucleotides are used, the probability of obtaining the correct topology (P1) is generally lower in the MP method than in the distance-matrix methods. The P1 value for the MP method increases with increasing number of nucleotides but is still generally lower than the value for the NJ or DW method. Essentially the same conclusion was obtained whether or not the rate of nucleotide substitution was constant or whether or not a transition bias in nucleotide substitution existed. The relatively poor performance of the MP method for these cases is due to the fact that information from singular sites is not used in this method. The MP method also showed a relatively low P1 value when the model of varying rate of nucleotide substitution was used and the number of substitutions per site was large. However, the MP method often produced cases in which the correct tree was one of several equally parsimonious trees. When these cases were included in the class of "success," the MP method performed better than the other methods, provided that the number of nucleotide substitutions per site was small.
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
Kimura, M. (1980) · Journal of Molecular Evolution · doi:10.1007/bf01731581 · Cited by 29,778
Cases in which parsimony or compatibility methods will be positively misleading.
Felsenstein, J. (1978) · Systematic Zoology · doi:10.2307/2412923 · Cited by 2,230
Cited by
PARSIMONY JACKKNIFING OUTPERFORMS NEIGHBOR‐JOINING
Farris, J. S., Albert, V. A., Källersjö, M., Lipscomb, D., & Kluge, A. G. (1996) · Cladistics · doi:10.1111/j.1096-0031.1996.tb00196.x · Cited by 1,504
A Simple Method for Estimating and Testing Minimum-Evolution Trees
(1992) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040771 · Cited by 1,482
Computational Molecular Evolution
Yang, Z. (2006) · doi:10.1093/acprof:oso/9780198567028.001.0001 · Cited by 1,148
A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates.
(1994) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040126 · Cited by 824
Success of Phylogenetic Methods in the Four-Taxon Case
Huelsenbeck, J. P., & Hillis, D. M. (1993) · Systematic Biology · doi:10.1093/sysbio/42.3.247 · Cited by 791
Metadata
- Venue
- Molecular Biology and Evolution
- Publisher
- Oxford University Press (OUP)
- Published
- 1988-05
- Volume
- 5
- Issue
- 3
- Pages
- 298-311
- ISSN
- 0737-4038 (ISSN-L)
- 1537-1719
- OpenAlex
- W2105807927
- Cited by
- 199
- References
- 2
- FWCI
- 3.30
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Relative efficiencies of the maximum parsimony and distance-matrix methods in obtaining the correct phylogenetic tree. https://app.cochat.ai/papers/10.1093/oxfordjournals.molbev.a040497
- The paper
- Relative efficiencies of the maximum parsimony and distance-matrix methods in obtaining the correct phylogenetic tree. (1988). Molecular Biology and Evolution. https://doi.org/10.1093/oxfordjournals.molbev.a040497
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.