Approximating Shortest Superstring Problem Using de Bruijn Graphs

Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin. Approximating Shortest Superstring Problem Using de Bruijn Graphs. In Johannes Fischer, Peter Sanders, editors, Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings. Volume 7922 of Lecture Notes in Computer Science, pages 120-129, Springer, 2013. [doi]

Abstract

Abstract is missing.