An efficient reduction from constrained to unconstrained maximum agreement subtree

Authors:
Z. S. Peng;H. F. Ting
Affiliations:
Department of Computer Science, The University of Hong Kong, Hong Kong;Department of Computer Science, The University of Hong Kong, Hong Kong
Venue:
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Year:
2005

Citing 10
Cited 1

Kaikoura tree theorems: computing the maximum agreement subtree

Information Processing Letters
Tree Contractions and Evolutionary Trees

SIAM Journal on Computing
Fast comparison of evolutionary trees

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings

Journal of Algorithms
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

SIAM Journal on Computing
A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Calculation, Visualization, and Manipulation of MASTs (Maximum Agreement Subtrees)

CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Optimal evolutionary tree comparison by sparse dynamic programming

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithms

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
An O(nlog n)-time algorithm for the maximum constrained agreement subtree problem for binary trees

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows users to apply their domain knowledge to control the construction of the agreement subtrees in order to get better results. We show that the MCAST problem can be reduced to the MAST problem efficiently and thus we have algorithms for MCAST with running times matching the fastest known algorithms for MAST.