Bin Ma. Why Greed Works for Shortest Common Superstring Problem. In Paolo Ferragina, Gad M. Landau, editors, Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings. Volume 5029 of Lecture Notes in Computer Science, pages 244-254, Springer, 2008. [doi]
Abstract is missing.