Rapidly computing the phylogenetic transfer index

DOI10.4230/LIPIcs.WABI.2019.20zbMath1495.92048OpenAlexW2977698319MaRDI QIDQ5091744

Krister M. Swenson, Jakub Truszkowski, Olivier Gascuel

Publication date: 27 July 2022

Full work available at URL: https://doi.org/10.4230/lipics.wabi.2019.20

zbMATH Keywords

bootstrap analysistree comparisondata structures on treeslarge phylogenies

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Problems related to evolution (92D15) Data structures (68P05) Computational methods for problems pertaining to biology (92-08)

Uses Software

• DendroPy
• RTED

Cites Work

• Fast error-tolerant quartet phylogeny algorithms
• Optimal algorithms for comparing trees with labeled leaves
• A data structure for dynamic trees
• Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
• A few logs suffice to build (almost) all trees. II
• Distribution and asymptotic behavior of the phylogenetic transfer distance
• Phylogeny
• Unnamed Item
• Unnamed Item

This page was built for publication: Rapidly computing the phylogenetic transfer index