Combinatorial Algorithms for Subsequence Matching: A Survey

Maria Kosche
(Göttingen University, Germany) 		Tore Koß
(Göttingen University, Germany) 		Florin Manea
(Göttingen University, Germany) 		Stefan Siemer
(Göttingen University, Germany)

In this paper we provide an overview of a series of recent results regarding algorithms for searching for subsequences in words or for the analysis of the sets of subsequences occurring in a word.

Invited Presentation in Henning Bordihn, Géza Horváth and György Vaszil: Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2022), Debrecen, Hungary, August 26-27, 2022, Electronic Proceedings in Theoretical Computer Science 367, pp. 11–27.
Published: 27th August 2022.
ArXived at: https://dx.doi.org/10.4204/EPTCS.367.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org