Communications of the ACM
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Data compression: methods and theory
Data compression: methods and theory
A greedy approximation algorithm for constructing shortest common superstrings
Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
Computational molecular biology
Computational molecular biology
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Approximation algorithms for the shortest common superstring problem
Information and Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the approximation of maximum satisfiability
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Mapping the genome: some combinatorial problems arising in molecular biology
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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
Physical mapping of chromosomes: a combinatorial problem in molecular biology
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An approximation algorithm for the minimum common supertree problem
Nordic Journal of Computing
Optimal prefix and suffix queries on texts
Information Processing Letters
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
| Hi-index | 0.00 |