article
Open access
Combinatorial Algorithms for Subsequence Matching: A Survey
Research footprint
At a glance
- Citations
- 13
- References
- 59
- Comments
- 0
Paper overview
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.
Record transparency
Publication details
- DOI
- 10.4204/eptcs.367.2
- OpenAlex
- W4293325561
- Document type
- article
- Language
- EN
- Source
- Electronic Proceedings in Theoretical Computer Science
- Last metadata update
Comments
Log in to join the discussion.