Rapidly computing the phylogenetic transfer index

DOI10.4230/LIPICS.WABI.2019.20MaRDI QIDQ5091744zbMATH OpenOpenAlexFDO

Authors Jakub Truszkowski, O. Gascuel, Krister M. Swenson

Publication date 27 July 2022

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

zbMATH Keywords

bootstrap analysisdata structures on treeslarge phylogeniestree comparison

Mathematics Subject Classification ID

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

Recommendations

• Distribution and asymptotic behavior of the phylogenetic transfer distance
• On the linear-cost subtree-transfer distance between phylogenetic trees
• An algebraic metric for phylogenetic trees
• scientific article; zbMATH DE number 2080274
• SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES

Cites work

• A data structure for dynamic trees
• A few logs suffice to build (almost) all trees. II
• Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
• Distribution and asymptotic behavior of the phylogenetic transfer distance
• Fast error-tolerant quartet phylogeny algorithms
• scientific article; zbMATH DE number 1541304 (Why is no real title available?)
• Introduction to algorithms
• Optimal algorithms for comparing trees with labeled leaves
• Phylogeny. Discrete and random processes in evolution

Cited in

(2)

• Computing and Combinatorics
• The topology diameters of the asymmetric cluster affinity cost

Describes a project that uses

Uses Software

• RTED
• DendroPy

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091744)