Linear approximation of shortest superstrings
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Mapping the genome: some combinatorial problems arising in molecular biology
STOC '93 Proceedings of the twenty-fifth 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
Physical mapping of chromosomes: a combinatorial problem in molecular biology
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
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
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
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)
Why Greed Works for Shortest Common Superstring Problem
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Why greed works for shortest common superstring problem
Theoretical Computer Science
Shortest common superstring problem with discrete neural networks
ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
Explicit inapproximability bounds for the shortest superstring problem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Efficient processing of distance queries in large graphs: a vertex cover approach
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
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 |