@InProceedings{mucha:LIPIcs.CPM.2017.3,
  author =	{Mucha, Marcin},
  title =	{{Shortest Superstring}},
  booktitle =	{28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
  pages =	{3:1--3:1},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-039-2},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{78},
  editor =	{K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.3},
  URN =		{urn:nbn:de:0030-drops-73483},
  doi =		{10.4230/LIPIcs.CPM.2017.3},
  annote =	{Keywords: shortest superstring, approximation algorithms}
}