Cited by 20Genomics and Phylogenetic StudiesStochastic processes and statistical mechanicsAdvanced Graph Theory Research

‘Lassoing’ a phylogenetic tree I: basic properties, shellings, and covers

Open access
Dress, Andreas W. M., Huber, Katharina T., Steel, Mike·2012·Journal of Mathematical Biology

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s00285-011-0450-4

Cites

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The BLS phylogenies are closer to the reference than standard MSA approaches, according to Kendall-Colijn and Triplet distance metrics.

    “Our phylogenetic similarity results, shown in Table 1 for two distance metrics, Kendall–Colijn37 and Triplet38 distance, indicate that the BLS phylogenies are closer to the reference than standard MSA approaches.”

    From Improving microbial phylogeny with citizen science within a mass-market video game (2025) · cites this paper as [38]

    The Introduction (pp. 1–2) addresses reconstructing trees from incomplete leaf-to-leaf distances, not comparing BLS phylogenies with standard MSA approaches. The copy does not address the claimed results or identify Kendall–Colijn or Triplet distance as comparison metrics; searches for those terms found no relevant passage. (LLM, conf=0.73)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

No references could be resolved yet.

Research works printed but not linked: 7

  1. [2][2] Barth´ elemy JP, Gu´ eoche A (1991) Trees and Proximity Representations. John Wiley and Sons Ltd. -
  2. [4][4] Chaiken S, Dewdney AK, Slater PJ (1983) An optimal diagonal tree code. SIAM J Alg Disc Math 4(1): 42-49. -
  3. [5][5] Colonius, H. and Schulze, H. H. (1981). Tree structures for proximity data. British Journal of Mathematical and Statistical Psychology, 34: 167-180. -
  4. [9][9] Dress A, Huber K, Koolen J, Moulton V, Spillner A (2011) Basic Phylogenetic Combinatorics. Cambridge University Press (in press). -
  5. [12][12] Gu´ enoche A, Leclerc B (2001) The triangles method to build X -trees from incomplete distance matrices. ROADEF'99 (Autrans) RAIRO Oper Res 35(2): 283-300. -
  6. [16][16] Semple C, Steel M (2003) Phylogenetics. Oxford University Press. -
  7. [18][18] Willson SJ (2004) Computing rooted supertrees using distances. Bull Math Biol 66(6): 1755-1783.

Cited by

Sorted by citations

Authors
Dress, A. W. M., Huber, K. T., & Steel, M.
Affiliations
  • Chinese Academy of Sciences (CN)
  • University of East Anglia (GB)
  • University of Canterbury (NZ)
Corresponding author
Huber, Katharina T.
Venue
Journal of Mathematical Biology
Published
2011-07-07
Volume
65
Issue
1
Pages
77-105
ISSN
  • 0303-6812 (ISSN-L)
  • 1432-1416
OpenAlex
W1995427389
Cited by
20
References
0
Citations by year
2024: 2 · 2018: 2 · 2017: 2 · 2015: 3 · 2014: 4 · 2013: 4 · 2012: 3
FWCI
1.42
Type
journal article
Language
en
Open access
Locations
  • Journal of Mathematical Biology (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Max Planck Institute for Plasma Physics (submittedVersion)
  • PUB – Publications at Bielefeld University (Bielefeld University) (submittedVersion)
  • UEA Digital Repository (University of East Anglia) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • University of Canterbury
  • Royal Society
  • Max-Planck-Gesellschaft
  • Engineering and Physical Sciences Research Council (EP/D068800/1)
  • Marsden Fund
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Physical Sciences › Mathematics › Mathematical Physics › Stochastic processes and statistical mechanics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
Keywords
phylogenetic inference, edge-weighted trees, shelling, tree cover, genetic distance, speciation events
MeSH terms
Biological Evolution, Models, Genetic, Phylogeny

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