A Fast Algorithm for Computing Geodesic Distances in Tree Space
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Comparing and computing distances between phylogenetic trees are important biological problems, especially for models where edge lengths play an important role. The geodesic distance measure between two phylogenetic trees with edge lengths is the length of the shortest path between them in the continuous tree space introduced by Billera, Holmes, and Vogtmann. This tree space provides a powerful tool for studying and comparing phylogenetic trees, both in exhibiting a natural distance measure and in providing a euclidean-like structure for solving optimization problems on trees. An important open problem is to find a polynomial time algorithm for finding geodesics in tree space. This paper gives such an algorithm, which starts with a simple initial path and moves through a series of successively shorter paths until the geodesic is attained.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Genome-scale approaches to resolving incongruence in molecular phylogenies.
Rokas, A., Williams, B. L., King, N., & Carroll, S. B. (2003) · Nature · doi:10.1038/nature02053 · Cited by 1,512
Cited by
Sensitivity and correlation of hypervariable regions in 16S rRNA genes in phylogenetic analysis
Yang, B., Wang, Y., & Qian, P.-Y. (2016) · BMC Bioinformatics · doi:10.1186/s12859-016-0992-y · Cited by 560
Bayesian Evolutionary Analysis with BEAST
Drummond, A. J., & Bouckaert, R. R. (2015) · Cambridge University Press eBooks · doi:10.1017/cbo9781139095112 · Cited by 527
Bayesian Total-Evidence Dating Reveals the Recent Crown Radiation of Penguins
Gavryushkina, A., Heath, T. A., Ksepka, D. T., Stadler, T., Welch, D., & Drummond, A. J. (2016) · Systematic Biology · doi:10.1093/sysbio/syw060 · Cited by 372
Assessing parameter identifiability in phylogenetic models using data cloning
Ponciano, J. M., Burleigh, J. G., Braun, E. L., & Taper, M. L. (2012) · Systematic Biology · doi:10.1093/sysbio/sys055 · Cited by 39
Metadata
- Authors
- Owen, M., & Provan, J. S.
- Venue
- IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Published
- 2011-01
- Volume
- 8
- Issue
- 1
- Pages
- 2-13
- ISSN
- 1545-5963 (ISSN-L)
- OpenAlex
- W2154675536
- Cited by
- 184
- References
- 1
- FWCI
- 4.37
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Fast Algorithm for Computing Geodesic Distances in Tree Space. https://app.cochat.ai/papers/10.1109/tcbb.2010.3
- The paper
- Owen, M., & Provan, J. S. (2011). A Fast Algorithm for Computing Geodesic Distances in Tree Space. IEEE/ACM Transactions on Computational Biology and Bioinformatics. https://doi.org/10.1109/tcbb.2010.3
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.