8 citations · 10 across the 5 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.FL2022
Combinatorial Algorithms for Subsequence Matching: A Survey
Maria Kosche, Tore Koß, Florin Manea +1
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 occu…
cs.FL2022★ 1 cited
Subsequences in Bounded Ranges: Matching and Analysis Problems
Maria Kosche, Tore Koß, Florin Manea +1
In this paper, we consider a variant of the classical algorithmic problem of checking whether a given word is a subsequence of another word . More precisely, we consider the…
cs.CC2022
Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems
Joel D. Day, Maria Kosche, Florin Manea +1
We consider subsequences with gap constraints, i.e., length-k subsequences p that can be embedded into a string w such that the induced gaps (i.e., the factors of w between the pos…