On Shortest Common Superstring and Swap Permutations.

Zvi Gotthilf|Moshe Lewenstein|Alexandru Popa


Anthology ID:DBLP:conf/spire/GotthilfLP10
Volume:String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings
Year:2010
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:270-278
URL:https://doi.org/10.1007/978-3-642-16321-0_28
DOI:https://doi.org/10.1007/978-3-642-16321-0_28
DBLP:conf/spire/GotthilfLP10
BibTeX:
@inproceedings{gotthilf-2010-shortest, author = {Zvi Gotthilf and Moshe Lewenstein and Alexandru Popa}, editor = {Edgar Ch\'{a}vez and Stefano Lonardi}, title = {{On Shortest Common Superstring and Swap Permutations}}, booktitle = {{String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {6393}, pages = {270--278}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16321-0_28}, doi = {https://doi.org/10.1007/978-3-642-16321-0_28} }