Combinatorial Algorithms for Subsequence Matching: A Survey
Formal Languages and Automata Theory
2022-10-11 v2 Data Structures and Algorithms
Abstract
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.
Cite
@article{arxiv.2208.14722,
title = {Combinatorial Algorithms for Subsequence Matching: A Survey},
author = {Maria Kosche and Tore Koß and Florin Manea and Stefan Siemer},
journal= {arXiv preprint arXiv:2208.14722},
year = {2022}
}
Comments
This is a revised version of the paper with the same title which appeared in the Proceedings of NCMA 2022, EPTCS 367, 2022, pp. 11-27 (DOI: 10.4204/EPTCS.367.2). The revision consists in citing a series of relevant references which were not covered in the initial version, and commenting on how they relate to the results we survey. arXiv admin note: text overlap with arXiv:2206.13896