An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings

Computing the maximum agreement of phylogenetic networks

Theoretical Computer Science - Pattern discovery in the post genome

Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Note: Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species

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

Kernels Based on Distributions of Agreement Subtrees

AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence

Linear time 3-approximation for the MAST problem

ACM Transactions on Algorithms (TALG)

On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems

Discrete Applied Mathematics

Complete enumeration of compact structural motifs in proteins

ISB '10 Proceedings of the International Symposium on Biocomputing

Pairwise global alignment of protein interaction networks by matching neighborhood topology

RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology

Faster algorithms for semi-matching problems

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming

Comparing and aggregating partially resolved trees

Theoretical Computer Science

Solving the maximum agreement subtree and the maximum compatible tree problems on many bounded degree trees

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching

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