Fast comparison of evolutionary trees

DOI10.1006/INCO.1995.1155zbMATH Open1096.92501OpenAlexW2019026763MaRDI QIDQ2508335FDOQ2508335

Authors: Martin Farach, Mikkel Thorup 

Publication date: 10 October 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1155

Recommendations

• scientific article; zbMATH DE number 1003280
• On the complexity of comparing evolutionary trees
• Computing the unrooted maximum agreement subtree in sub-quadratic time
• scientific article; zbMATH DE number 1002201
• Sparse Dynamic Programming for Evolutionary-Tree Comparison

Mathematics Subject Classification ID

Problems related to evolution (92D15) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited In (10)

• Linear time 3-approximation for the MAST problem
• APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD
• Title not available (Why is that?)
• Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
• Fast compatibility testing for rooted phylogenetic trees
• Title not available (Why is that?)
• Computing the agreement of trees with bounded degrees
• Computing the unrooted maximum agreement subtree in sub-quadratic time
• On finding the Adams consensus tree
• An improved algorithm for the maximum agreement subtree problem

This page was built for publication: Fast comparison of evolutionary trees

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