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.
Combinatorial Algorithms for Subsequence Matching: A Survey
Related papers
- A family of fast exact pattern matching algorithms (2016)β
- New Error Tolerant Method to Search Long Repeats in Symbol Sequences (2016)β
- Optimal-Hash Exact String Matching Algorithms (2023)β
- Effective and Efficient Variable-Length Data Series Analytics (2020)β
- Alphabet-dependent Parallel Algorithm for Suffix Tree Construction for Pattern Searching (2017)β
- CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination (2026)β
- MS-Index: Fast Top-k Subsequence Search for Multivariate Time Series under Euclidean Distance (2025)β
- Contextual Pattern Matching (2020)β