Approximate Cartesian Tree Matching: An Approach Using Swaps.
Bastien Auvray|Julien David|Richard Groult|Thierry Lecroq
| Anthology ID: | DBLP:conf/spire/AuvrayDGL23 |
|---|---|
| Volume: | String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings |
| Year: | 2023 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 49-61 |
| URL: | https://doi.org/10.1007/978-3-031-43980-3_5 |
| DOI: | https://doi.org/10.1007/978-3-031-43980-3_5 |
| DBLP: | conf/spire/AuvrayDGL23 |
| BibTeX: |
@inproceedings{auvray-2023-approximate,
author = {Bastien Auvray and
Julien David and
Richard Groult and
Thierry Lecroq},
editor = {Franco Maria Nardini and
Nadia Pisanti and
Rossano Venturini},
title = {{Approximate Cartesian Tree Matching: An Approach Using Swaps}},
booktitle = {{String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {14240},
pages = {49--61},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43980-3_5},
doi = {https://doi.org/10.1007/978-3-031-43980-3_5}
}