Computing the quartet distance between evolutionary trees

Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

Supertrees by Flipping

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics

Minimum-Flip Supertrees: Complexity and Algorithms

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

Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference

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

Fast error-tolerant quartet phylogeny algorithms

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching

Towards a practical O(n log n) phylogeny algorithm

WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics

Computing the quartet distance between trees of arbitrary degree

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

A robinson-foulds measure to compare unrooted trees with rooted trees

ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications

Fast error-tolerant quartet phylogeny algorithms

Theoretical Computer Science