Computing the unrooted maximum agreement subtree in sub-quadratic time

DOI10.1007/3-540-61422-2_126zbMATH Open1504.68279OpenAlexW1849794777MaRDI QIDQ5054809FDOQ5054809

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

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

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)

Cites Work

• Computational complexity of inferring phylogenies from dissimilarity matrices
• Kaikoura tree theorems: Computing the maximum agreement subtree
• Faster Scaling Algorithms for Network Problems
• Two strikes against perfect phylogeny
• Title not available (Why is that?)
• Title not available (Why is that?)
• An algorithm to find agreement subtrees
• Computing the agreement of trees with bounded degrees
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
• Title not available (Why is that?)
• 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)