Algorithms for three versions of the shortest common superstring problem

Crochemore, Maxime; Cygan, Marek; Iliopoulos, Costas S.; Kubica, Marcin; Radoszewski, Jakub; Rytter, Wojciech; Walen, Tomasz

by Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen

Reference:

Algorithms for three versions of the shortest common superstring problem (Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen), In Proceedings of the 21st Annual Conference on Combinatorial pattern matching, Springer-Verlag, 2010.

Bibtex Entry:

@INPROCEEDINGS{cpm_2010_b,
	author = "Maxime Crochemore and Marek Cygan and Costas S. Iliopoulos and Marcin Kubica and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen",
	title = "Algorithms for three versions of the shortest common superstring problem",
	booktitle = "Proceedings of the 21st Annual Conference on Combinatorial pattern matching",
	series = "CPM'10",
	year = "2010",
	pages = "299--309",
	publisher = "Springer-Verlag",
	address = "Berlin, Heidelberg"
}