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]
@inproceedings{GolovnevKM13,
title = {Approximating Shortest Superstring Problem Using de Bruijn Graphs},
author = {Alexander Golovnev and Alexander S. Kulikov and Ivan Mihajlin},
year = {2013},
doi = {10.1007/978-3-642-38905-4_13},
url = {http://dx.doi.org/10.1007/978-3-642-38905-4_13},
researchr = {https://researchr.org/publication/GolovnevKM13},
cites = {0},
citedby = {0},
pages = {120-129},
booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings},
editor = {Johannes Fischer and Peter Sanders},
volume = {7922},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-38905-4},
}