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

General techniques for comparing unrooted evolutionary trees

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Approximating the Maximum Isomorphic Agreement Subtree Is Hard

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching

A Faster and Unifying Algorithm for Comparing Trees

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching

Finding Smallest Supertrees Under Minor Containment

WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science

A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms

Computing unrooted maximum subtrees in sub-quartic time

Nordic Journal of Computing

Approximating the nearest neighbor interchange distance for evolutionary trees with non-uniform degrees

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Applications of FFT and structured matrices

Algorithms and theory of computation handbook

Boolean property encoding for local set pattern discovery: an application to gene expression data analysis

LPD'04 Proceedings of the 2004 international conference on Local Pattern Detection