An Algorithm for Finding a Representation of a Subtree Distance

DOI10.1007/978-3-319-45587-7_22zbMath1451.05064OpenAlexW2627034902MaRDI QIDQ2835681

Kazutoshi Ando, Koki Sato

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_22

zbMATH Keywords

phylogenytree metricsrealization algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Problems related to evolution (92D15) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• A fast algorithm for constructing trees from distance matrices
• A note on the metric properties of trees
• Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
• Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
• Characterization of the distance between subtrees of a tree by the associated tight span

This page was built for publication: An Algorithm for Finding a Representation of a Subtree Distance