Optimal parallel suffix-prefix matching algorithm and applications
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Linear approximation of shortest superstrings
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Linear approximation of shortest superstrings
Journal of the ACM (JACM)
Large-scale assembly of DNA strings and space-efficient construction of suffix trees
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
An 8/13-approximation algorithm for the asymmetric maximum TSP
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computing in Science and Engineering
An approximation algorithm for the minimum common supertree problem
Nordic Journal of Computing
Approximating asymmetric maximum TSP
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Suerstring Problem
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
An 8/13-approximation algorithm for the asymmetric maximum TSP
Journal of Algorithms
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM (JACM)
Optimal prefix and suffix queries on texts
Information Processing Letters
Why Greed Works for Shortest Common Superstring Problem
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Reoptimization of the Shortest Common Superstring Problem
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Why greed works for shortest common superstring problem
Theoretical Computer Science
Algorithms for three versions of the shortest common superstring problem
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Explicit inapproximability bounds for the shortest superstring problem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
A probabilistic PTAS for shortest common superstring
Theoretical Computer Science
| Hi-index | 0.00 |