Author:
Auvray Bastien,David Julien,Groult Richard,Lecroq Thierry
Publisher
Springer Nature Switzerland
Reference16 articles.
1. Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333–340 (1975)
2. Amir, A., Aumann, Y., Landau, G.M., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, USA, 19–22 October 1997, pp. 144–153. IEEE Computer Society (1997)
3. Crochemore, M., Russo, L.M.: Cartesian and Lyndon trees. Theor. Comput. Sci. 806, 1–9 (2020)
4. Demaine, E.D., Landau, G.M., Weimann, O.: On Cartesian trees and range minimum queries. Algorithmica 68(3), 610–625 (2014)
5. Faro, S., Lecroq, T.: The exact online string matching problem: a review of the most recent results. ACM Comput. Surv. 45(2), 13 (2013)