Evidence map›Paper›PMID 42853487›Full record

ArticleBulletin of mathematical biology2026

Tree Rearrangement Graphs Admit Paths of Decreasing Robinson-Foulds Distance.

Lena Collienne, Frederick A Matsen Iv

Abstract read
In one paragraph

Article in Bulletin of mathematical biology, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

5 · Who and what money

Authors and funding

2 authors.

Lena CollienneSchool of Computing, University of Otago, Dunedin, Otago, New Zealand. lena@lenacoll.de.ORCID 0000-0003-4215-8263
Frederick A Matsen IvComputational Biology Program, Fred Hutchinson Cancer Research Center, Seattle, WA, USA.ORCID 0000-0003-0607-6025

Funding

Fast and flexible Bayesian phylogenetics via modern machine learningR01AI162611 · NIAID · FRED HUTCHINSON CANCER RESEARCH CENTER · PI MATSEN, FREDERICK ALBERT · 2021 to 2025
$3.8M
National Science Foundation DMS-1929284NIAID NIH HHS R01 AI162611NIH HHS R01-AI162611
6 · The paper itself

Abstract

Tree rearrangements such as Nearest Neighbor Interchange (NNI) and Subtree Prune and Regraft (SPR) are commonly used to explore phylogenetic treespace. Computing distances based on them, however, is often intractable, so the efficiently computable Robinson-Foulds (RF) distance is used in practice. We investigate how the RF distance behaves along paths in the NNI and SPR graphs, where trees are nodes and edges represent single rearrangements. We show that any two trees are connected by a path along which the RF distance to the target decreases monotonically in the NNI graph and strictly in the SPR graph; we also show that a strictly decreasing NNI path does not always exist.

Indexed as

Models, GeneticPhylogenyAlgorithmsComputational BiologyComputer SimulationMathematical ConceptsPhylogeneticsTree distancesTree rearrangementsTreespace

Identifiers

PMID42853487
PMCPMC13652775

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.