Greedy Shortest Common Superstring Approximation in Compact Space.

Jarno Alanko|Tuukka Norri


Anthology ID:DBLP:conf/spire/AlankoN17
Volume:String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings
Year:2017
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:1-13
URL:https://doi.org/10.1007/978-3-319-67428-5_1
DOI:https://doi.org/10.1007/978-3-319-67428-5_1
DBLP:conf/spire/AlankoN17
BibTeX:
@inproceedings{alanko-2017-greedy, author = {Jarno Alanko and Tuukka Norri}, editor = {Gabriele Fici and Marinella Sciortino and Rossano Venturini}, title = {{Greedy Shortest Common Superstring Approximation in Compact Space}}, booktitle = {{String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {10508}, pages = {1--13}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-67428-5_1}, doi = {https://doi.org/10.1007/978-3-319-67428-5_1} }