Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes.

Maxime Crochemore|Costas S. Iliopoulos|Tomasz Kociumaka|Marcin Kubica|Alessio Langiu|Solon P. Pissis|Jakub Radoszewski|Wojciech Rytter|Tomasz Walen

Anthology ID:DBLP:conf/spire/CrochemoreIKKLPRRW13
Volume:String Processing and Information Retrieval - 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings
Year:2013
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:84-95
URL:https://doi.org/10.1007/978-3-319-02432-5_13
DOI:https://doi.org/10.1007/978-3-319-02432-5_13
DBLP:conf/spire/CrochemoreIKKLPRRW13
BibTeX:
@inproceedings{crochemore-2013-orderpreserving, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Marcin Kubica and Alessio Langiu and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, editor = {Oren Kurland and Moshe Lewenstein and Ely Porat}, title = {{Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes}}, booktitle = {{String Processing and Information Retrieval - 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {8214}, pages = {84--95}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-319-02432-5_13}, doi = {https://doi.org/10.1007/978-3-319-02432-5_13} }