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

Authors:
Z. S. Peng;H. F. Ting
Affiliations:
The Centre for Applied Genomics in Genetics and Genomics Biology, The Hospital for Sick Children MaRS Centre, Toronto, Ontario, Canada;The Centre for Applied Genomics in Genetics and Genomics Biology, The Hospital for Sick Children MaRS Centre, Toronto, Ontario, Canada
Venue:
Information Processing Letters
Year:
2006

Citing 8
Cited 0

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
Determining the evolutionary tree

SODA '90 Proceedings of the first 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
An efficient reduction from constrained to unconstrained maximum agreement subtree

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper introduces the maximum constrained agreement subtree problem, which is a generalization of the classical maximum agreement subtree problem. This new problem is motivated by the understood constraint when we compare the evolutionary trees. We give an O(n log n)-time algorithm for solving the problem when the input trees are binary. The time complexity of our algorithm matches the fastest known algorithm for the maximum agreement subtree problem for binary trees.