The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
The complexity of reconstructing trees from qualitative characters and subtrees
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
Graph Theory with Applications
Bondy, J. A., & Murty, U. S. R. (1976) · doi:10.1007/978-1-349-03521-2 · Cited by 9,043
Algorithmic Graph Theory and Perfect Graphs
(2004) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(04)x8001-8 · Cited by 3,729
PHYLOGENETIC ANALYSIS: MODELS AND ESTIMATION PROCEDURES
Cavalli-Sforza, L. L., & Edwards, A. W. F. (1967) · Evolution · doi:10.1111/j.1558-5646.1967.tb03411.x · Cited by 2,227
PHYLOGENIES FROM MOLECULAR SEQUENCES: INFERENCE AND RELIABILITY
Felsenstein, J. (1988) · Annual Review of Genetics · doi:10.1146/annurev.ge.22.120188.002513 · Cited by 2,128
The Recovery of Trees from Measures of Dissimilarity
Buneman, P. (1971) · Cited by 483
Bulletin of Mathematical Biology
(2013) · Bulletin of Mathematical Biology · doi:10.1007/11538.1522-9602 · Cited by 409
Efficient algorithms for inferring evolutionary trees
Gusfield, D. (1991) · Networks · doi:10.1002/net.3230210104 · Cited by 399
Aho, A. V., Sagiv, Y., Szymanski, T. G., & Ullman, J. D. (1981) · SIAM Journal on Computing · doi:10.1137/0210030 · Cited by 392
Mathematics in the Archaeological and Historical Sciences
(1970) · Bulletin of the London Mathematical Society · doi:10.1112/blms/2.2.252 · Cited by 388
Comparison of Undirected Phylogenetic Trees Based on Subtrees of Four Evolutionary Units
Estabrook, G. F., McMorris, F. R., & Meacham, C. A. (1985) · Systematic Biology · doi:10.2307/sysbio/34.2.193 · Cited by 253
Reconstructing the shape of a tree from observed dissimilarity data
Bandelt, H.-J., & Dress, A. (1986) · Advances in Applied Mathematics · doi:10.1016/0196-8858(86)90038-2 · Cited by 253
Optimal algorithms for comparing trees with labeled leaves
Day, W. H. E. (1985) · Journal of Classification · doi:10.1007/bf01908061 · Cited by 249
On the similarity of dendrograms
Waterman, M. S., & Smith, T. F. (1978) · Journal of Theoretical Biology · doi:10.1016/0022-5193(78)90137-6 · Cited by 206
Taxonomic Congruence in the Leptopodomorpha Re-examined
Sokal, R. R., & Rohlf, F. J. (1981) · Systematic Biology · doi:10.1093/sysbio/30.3.309 · Cited by 204
Invariants of phylogenies in a simple case with discrete states
Cavender, J. A., & Felsenstein, J. (1987) · Journal of Classification · doi:10.1007/bf01890075 · Cited by 193
Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
Gordon, A. (1986) · Journal of Classification · doi:10.1007/bf01894195 · Cited by 193
Comparison of Undirected Phylogenetic Trees Based on Subtrees of Four Evolutionary Units
Estabrook, G. F., McMorris, F. R., & Meacham, C. A. (1985) · Systematic Zoology · doi:10.2307/2413326 · Cited by 183
Taxonomic Congruence in the Leptopodomorpha Re-Examined
Sokal, R. R., & Rohlf, F. J. (1981) · Systematic Zoology · doi:10.2307/2413252 · Cited by 180
A non-sequential method for constructing trees and hierarchical classifications
Fitch, W. M. (1981) · Journal of Molecular Evolution · doi:10.1007/bf01733209 · Cited by 118
Tree structures for proximity data
Colonius, H., & Schulze, H.-H. (1981) · British Journal of Mathematical and Statistical Psychology · doi:10.1111/j.2044-8317.1981.tb00626.x · Cited by 103
On the Distribution of Lengths of Evolutionary Trees
Carter, M., Hendy, M. D., Penny, D., Székely, Ł. A., & Wormald, N. C. (1990) · SIAM Journal on Discrete Mathematics · doi:10.1137/0403005 · Cited by 43
Quadratic tree invariants for multivalued characters
Drolet, S., & Sankoff, D. (1990) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(05)80303-0 · Cited by 10
Cited by
A maximum pseudo-likelihood approach for estimating species trees under the coalescent model
Liu, L., Yu, L., & Edwards, S. V. (2010) · BMC Evolutionary Biology · doi:10.1186/1471-2148-10-302 · Cited by 607
PARAMETERIZED COMPLEXITY THEORY
Niedermeier, R. (2006) · Invitation to Fixed-Parameter Algorithms · doi:10.1093/acprof:oso/9780198566076.003.0013 · Cited by 574
‘Lassoing’ a phylogenetic tree I: basic properties, shellings, and covers
Dress, A. W. M., Huber, K. T., & Steel, M. (2012) · Journal of Mathematical Biology · doi:10.1007/s00285-011-0450-4 · Cited by 20
Self-citation
Metadata
- Authors
- Steel, M.
- Venue
- Journal of Classification
- Published
- 1992-01
- Volume
- 9
- Issue
- 1
- Pages
- 91-116
- ISSN
- 0176-4268 (ISSN-L)
- 1432-1343
- OpenAlex
- W2075503802
- Cited by
- 508
- References
- 22
- FWCI
- 3.05
- 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.
