Compressed Suffix Trees for Repetitive Texts.

Andrés Abeliuk|Gonzalo Navarro


Anthology ID:DBLP:conf/spire/AbeliukN12
Volume:String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings
Year:2012
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:30-41
URL:https://doi.org/10.1007/978-3-642-34109-0_5
DOI:https://doi.org/10.1007/978-3-642-34109-0_5
DBLP:conf/spire/AbeliukN12
BibTeX:
@inproceedings{abeliuk-2012-compressed, author = {Andr\'{e}s Abeliuk and Gonzalo Navarro}, editor = {Liliana Calder\'{o}n-Benavides and Cristina N. Gonz\'{a}lez-Caro and Edgar Ch\'{a}vez and Nivio Ziviani}, title = {{Compressed Suffix Trees for Repetitive Texts}}, booktitle = {{String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {7608}, pages = {30--41}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34109-0_5}, doi = {https://doi.org/10.1007/978-3-642-34109-0_5} }