Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees

Authors:
Ming-Yang Kao;Tak-Wah Lam;Wing-Kin Sung;Hing-Fung Ting
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Computing
Year:
2000

Citing 0
Cited 4

Algorithm for the Cost Edge-Coloring of Trees

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Approximate labelled subtree homeomorphism

Journal of Discrete Algorithms
RNA tree comparisons via unrooted unordered alignments

WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm for computing a maximum agreement subtree of two unrooted evolutionary trees. It takes O(n1.5 log n) time for trees with unbounded degrees, matching the best known time complexity for the rooted case. Our algorithm allows the input trees to be mixed trees, i.e., trees that may contain directed and undirected edges at the same time. Our algorithm adopts a recursive strategy exploiting a technique called label compression. The backbone of this technique is an algorithm that computes the maximum weight matchings over many subgraphs of a bipartite graph as fast as it takes to compute a single matching.