Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Faster scaling algorithms for network problems
SIAM Journal on Computing
A robust model for finding optimal evolutionary trees
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Determining the evolutionary tree
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Two Strikes Against Perfect Phylogeny
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
General techniques for comparing unrooted evolutionary trees
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On reconstructing species trees from gene trees in term of duplications and losses
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient Merging, Construction, and Maintenance of Evolutionary Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Finding Smallest Supertrees Under Minor Containment
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Computing unrooted maximum subtrees in sub-quartic time
Nordic Journal of Computing
Calculation, Visualization, and Manipulation of MASTs (Maximum Agreement Subtrees)
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
A survey on tree edit distance and related problems
Theoretical Computer Science
Computing the maximum agreement of phylogenetic networks
Theoretical Computer Science - Pattern discovery in the post genome
Visualising phylogenetic trees
AUIC '06 Proceedings of the 7th Australasian User interface conference - Volume 50
Pattern Identification in Biogeography
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
Information Processing Letters
Balanced randomized tree splitting with applications to evolutionary tree constructions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the parameterized complexity of the Multi-MCT and Multi-MCST problems
Journal of Combinatorial Optimization
A new framework for phylogenetic tree visualization
IVIC'11 Proceedings of the Second international conference on Visual informatics: sustaining research and innovations - Volume Part II
An efficient reduction from constrained to unconstrained maximum agreement subtree
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
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
| Hi-index | 0.00 |