Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
A greedy approximation algorithm for constructing shortest common superstrings
Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Fast parallel and serial approximate string matching
Journal of Algorithms
Approximation algorithms for the shortest common superstring problem
Information and Computation
Linear approximation of shortest superstrings
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Recursive star-tree parallel data structure
SIAM Journal on Computing
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Guide to Human Genome Computing
Guide to Human Genome Computing
Large-scale assembly of DNA strings and space-efficient construction of suffix trees
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Large-scale assembly of DNA strings and space-efficient construction of suffix trees
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the sorting-complexity of suffix tree construction
Journal of the ACM (JACM)
Separating repeats in DNA sequence assembly
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Integrating a real-world scheduling problem into the basic algorithms course
Journal of Computing Sciences in Colleges - Papers of the twelfth annual CCSC Northeastern Conference
| Hi-index | 0.00 |