Publisher
Springer Nature Switzerland
Reference20 articles.
1. Auvray, B., David, J., Groult, R., Lecroq, T.: Approximate Cartesian tree matching: an approach using swaps. In: Proceedings of the 30th International Symposium on String Processing and Information Retrieval, pp. 49–61 (2023)
2. Biedl, T., et al.: Rollercoasters and caterpillars. In: Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, pp. 18:1–18:15 (2018)
3. Bille, P.: A survey on tree edit distance and related problems. Theoret. Comput. Sci. 337(1–3), 217–239 (2005)
4. Cho, S., Na, J.C., Park, K., Sim, J.S.: A fast algorithm for order-preserving pattern matching. Inf. Process. Lett. 115, 397–402 (2015)
5. Faro, S., Lecroq, T., Park, K., Scafiti, S.: On the longest common Cartesian substring problem. Comput. J. 66(4), 907–923 (2023)