Combinatorial Algorithms for Subsequence Matching: A Survey
Maria Kosche (G\"ottingen University, Germany), Tore Ko{\ss}, (G\"ottingen University, Germany), Florin Manea (G\"ottingen University,, Germany), Stefan Siemer (G\"ottingen University, Germany)
TL;DR
This survey reviews recent advances in algorithms for subsequence matching, focusing on searching for subsequences within words and analyzing their sets, highlighting key methods and results.
Contribution
It compiles and discusses recent algorithmic developments in subsequence matching, providing a comprehensive overview of the field.
Findings
Summarizes recent algorithmic techniques for subsequence search
Highlights new methods for analyzing subsequence sets
Identifies open problems and future research directions
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · semigroups and automata theory · Natural Language Processing Techniques