The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Reconstructing the shape of a tree from observed dissimilarity data
Open accessAbstract
Branching structures, alias topological tree structures are fundamental to any hierarchical classification that aims to relate objects according to their similarities or dissimilarities. This paper provides a rigorous treatment of these structures, and continues previous work of Colonius and Schulze on H-structures. Thus extensive use is made of the so-called neighbors relation associated with a dissimilarity index. Arbitrary dissimilarity data are then analyzed by comparing their neighbors relations with ideal, that is, tree-like relations: if it matches an ideal relation, then one can readily construct a tree representing the data that is optimal in a certain sense. Finally, some algorithms are proposed for fitting observed data to tree-like data.
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
A note on the metric properties of trees
Buneman, P. (1974) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(74)90047-1 · Cited by 329
Cited by
Quartet Puzzling: A Quartet Maximum-Likelihood Method for Reconstructing Tree Topologies
Strimmer, K., & von Haeseler, A. (1996) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a025664 · Cited by 2,531
The complexity of reconstructing trees from qualitative characters and subtrees
Steel, M. (1992) · Journal of Classification · doi:10.1007/bf02618470 · Cited by 508
Metadata
- Authors
- Bandelt, H.-J., & Dress, A.
- Venue
- Advances in Applied Mathematics
- Publisher
- Elsevier BV
- Published
- 1986-09
- Volume
- 7
- Issue
- 3
- Pages
- 309-343
- ISSN
- 0196-8858 (ISSN-L)
- OpenAlex
- W2042959539
- Cited by
- 253
- References
- 1
- FWCI
- 2.08
- 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: Reconstructing the shape of a tree from observed dissimilarity data. https://app.cochat.ai/papers/10.1016/0196-8858(86)90038-2
- The paper
- Bandelt, H.-J., & Dress, A. (1986). Reconstructing the shape of a tree from observed dissimilarity data. Advances in Applied Mathematics. https://doi.org/10.1016/0196-8858(86)90038-2
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.
