A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem

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

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

The greedy algorithm for shortest superstrings

Information Processing Letters

Algorithms for three versions of the shortest common superstring problem

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching

Viral genome compression

DNA'06 Proceedings of the 12th international conference on DNA Computing

A 6-approximation algorithm for computing smallest common aon-supertree with application to the reconstruction of glycan trees

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

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

A probabilistic PTAS for shortest common superstring

Theoretical Computer Science