All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent.

Maksim S. Nikolaev

Browse the full SPIRE paper archive.