Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
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
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 |