Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Efficient Merging, Construction, and Maintenance of Evolutionary Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Complexity of Constructing Evolutionary Trees Using Experiments
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Information and Computation
Algorithms for combining rooted triplets into a galled phylogenetic network
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Inferring a level-1 phylogenetic network from a dense set of rooted triplets
Theoretical Computer Science - Computing and combinatorics
On the longest path algorithm for reconstructing trees from distance matrices
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
New results on optimizing rooted triplets consistency
Discrete Applied Mathematics
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
Fast error-tolerant quartet phylogeny algorithms
Theoretical Computer Science
Kernel and fast algorithm for dense triplet inconsistency
Theoretical Computer Science
| Hi-index | 0.00 |