On the Hardness of Computing the Edit Distance of Shallow Trees.
Panagiotis Charalampopoulos|Pawel Gawrychowski|Shay Mozes|Oren Weimann
| Anthology ID: | DBLP:conf/spire/Charalampopoulos22a |
|---|---|
| Volume: | String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8-10, 2022, Proceedings |
| Year: | 2022 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 290-302 |
| URL: | https://doi.org/10.1007/978-3-031-20643-6_21 |
| DOI: | https://doi.org/10.1007/978-3-031-20643-6_21 |
| DBLP: | conf/spire/Charalampopoulos22a |
| BibTeX: |
@inproceedings{charalampopoulos-2022-hardness,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Diego Arroyuelo and
Barbara Poblete},
title = {{On the Hardness of Computing the Edit Distance of Shallow Trees}},
booktitle = {{String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Concepci\'{o}n, Chile, November 8-10, 2022, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {13617},
pages = {290--302},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20643-6_21},
doi = {https://doi.org/10.1007/978-3-031-20643-6_21}
}