Better Heuristic Algorithms for the Repetition Free LCS and Other Variants.

Radu Stefan Mincu|Alexandru Popa


Anthology ID:DBLP:conf/spire/MincuP18
Volume:String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings
Year:2018
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:297-310
URL:https://doi.org/10.1007/978-3-030-00479-8_24
DOI:https://doi.org/10.1007/978-3-030-00479-8_24
DBLP:conf/spire/MincuP18
BibTeX:
@inproceedings{mincu-2018-better, author = {Radu Stefan Mincu and Alexandru Popa}, editor = {Travis Gagie and Alistair Moffat and Gonzalo Navarro and Ernesto Cuadros-Vargas}, title = {{Better Heuristic Algorithms for the Repetition Free LCS and Other Variants}}, booktitle = {{String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {11147}, pages = {297--310}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00479-8_24}, doi = {https://doi.org/10.1007/978-3-030-00479-8_24} }