Computing the unrooted maximum agreement subtree in sub-quadratic time

DOI10.1007/3-540-61422-2_126MaRDI QIDQ5054809zbMATH OpenOpenAlexFDO

Authors Wing-Kin Sung, Tak-Wah Lam, Hing-Fung Ting

Publication date 9 December 2022

Published in Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61422-2_126

Mathematics Subject Classification ID

Problems related to evolution (92D15) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1002201
• scientific article; zbMATH DE number 1003280
• On the agreement of many trees
• Fast comparison of evolutionary trees
• An improved algorithm for the maximum agreement subtree problem

Cites work

• scientific article; zbMATH DE number 1003279 (Why is no real title available?)
• scientific article; zbMATH DE number 1003280 (Why is no real title available?)
• scientific article; zbMATH DE number 871929 (Why is no real title available?)
• scientific article; zbMATH DE number 910861 (Why is no real title available?)
• An algorithm to find agreement subtrees
• Computational complexity of inferring phylogenies from dissimilarity matrices
• Computing the agreement of trees with bounded degrees
• Faster Scaling Algorithms for Network Problems
• Kaikoura tree theorems: Computing the maximum agreement subtree
• Two strikes against perfect phylogeny

Cited in

(3)

• Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
• scientific article; zbMATH DE number 1559522 (Why is no real title available?)
• Fast comparison of evolutionary trees

This page was built for publication: Computing the unrooted maximum agreement subtree in sub-quadratic time

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