Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Calculation, Visualization, and Manipulation of MASTs (Maximum Agreement Subtrees)
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
An improved algorithm for the maximum agreement subtree problem
Information Processing Letters
Computing the maximum agreement of phylogenetic networks
Theoretical Computer Science - Pattern discovery in the post genome
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An algebraic view of the relation between largest common subtrees and smallest common supertrees
Theoretical Computer Science
Theoretical Computer Science
An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
Information Processing Letters
Maximum agreement and compatible supertrees
Journal of Discrete Algorithms
Efficient Algorithms for SNP Haplotype Block Selection Problems
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Linear time 3-approximation for the MAST problem
ACM Transactions on Algorithms (TALG)
An improved algorithm for the maximum agreement subtree problem
Information Processing Letters
New common ancestor problems in trees and directed acyclic graphs
Information Processing Letters
Partitioning polygons into tree monotone and y-monotone subpolygons
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
A metric for phylogenetic trees based on matching
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Removing noise from gene trees
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On the approximation of computing evolutionary trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
An efficient reduction from constrained to unconstrained maximum agreement subtree
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
The maximum agreement of two nested phylogenetic networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
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
A Metric for Phylogenetic Trees Based on Matching
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Succinct representations of weighted trees supporting path queries
Journal of Discrete Algorithms
| Hi-index | 0.00 |
The maximum agreement subtree problem is the following. Given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these items so that the portions of the two trees restricted to these items are isomorphic. We consider the case which occurs frequently in practice, i.e., the case when the trees are binary, and give an O(nlog n) time algorithm for this problem.