Position Heaps for Cartesian-Tree Matching on Strings and Tries.

Akio Nishimoto|Noriki Fujisato|Yuto Nakashima|Shunsuke Inenaga

Anthology ID:DBLP:conf/spire/NishimotoFNI21
Volume:String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings
Year:2021
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:241-254
URL:https://doi.org/10.1007/978-3-030-86692-1_20
DOI:https://doi.org/10.1007/978-3-030-86692-1_20
DBLP:conf/spire/NishimotoFNI21
BibTeX:
@inproceedings{nishimoto-2021-position, author = {Akio Nishimoto and Noriki Fujisato and Yuto Nakashima and Shunsuke Inenaga}, editor = {Thierry Lecroq and H\'{e}l\`{e}ne Touzet}, title = {{Position Heaps for Cartesian-Tree Matching on Strings and Tries}}, booktitle = {{String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {12944}, pages = {241--254}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86692-1_20}, doi = {https://doi.org/10.1007/978-3-030-86692-1_20} }