ArticleIEEE transactions on computational biology and bioinformatics
Distances Between Extension Spaces of Phylogenetic Trees.
Article in IEEE transactions on computational biology and bioinformatics. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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.
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.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
Abstract
Phylogenetic trees summarize evolutionary relationships between organisms, and tools to analyze collections of phylogenetic trees enable contrasts between different genes' ancestry. The BHV metric space has enabled the analysis of collections of trees that share a common set of leaves, but in practice, many genes are not shared, even between closely related species. BHV extension spaces represent trees with non-identical leaf sets in a common BHV space, but limited analytical tools exist for extension spaces. We define the distance between two phylogenetic trees with non-identical leaf sets as the shortest BHV distance between their extension spaces, and develop a reduced gradient algorithm to compute this distance. We study the scalability of our algorithm and apply it to analyze gene trees spanning multiple domains of life. Our distance and algorithm offer a fully general, interpretable approach to analyzing both ancient and recent evolutionary divergence.
Identifiers
What OpenQuestion holds
Registered trials
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.