An approximation algorithm for the minimum common supertree problem
Nordic Journal of Computing
The greedy algorithm for shortest superstrings
Information Processing Letters
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM (JACM)
The Shortest Common Superstring Problem and Viral Genome Compression
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
The greedy algorithm for shortest superstrings
Information Processing Letters
DNA'06 Proceedings of the 12th international conference on DNA Computing
The Shortest Common Superstring Problem and Viral Genome Compression
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
| Hi-index | 0.00 |