Minimal representation of directed hypergraphs
SIAM Journal on Computing
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Speeding up dynamic programming with application to molecular biology
Theoretical Computer Science
Dynamic maintenance of directed hypergraphs
Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
A robust model for finding optimal evolutionary trees
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Inferring Evolutionary History from DNA Sequences
SIAM Journal on Computing
Tree compatibility and inferring evolutionary history
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
An Algorithm for Locating Non-Overlapping Regions of Maximum Alignment Score
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
An Algorithm for Approximate Tandem Repeats
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Exact and Approximation Algorithms for the Inversion Distance Between Two Chromosomes
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Journal of the ACM (JACM)
To cut…or not to cut (applications of comparative physical maps in molecular evolution)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A Greedy Algorithm for Optimal Recombination
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Computing unrooted maximum subtrees in sub-quartic time
Nordic Journal of Computing
Routes and Products of Monoids
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Genome-wide compatible SNP intervals and their properties
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
Routes and Products of Monoids
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
| Hi-index | 0.00 |