3 citations · 5 across the 7 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.FL2022
Extending Shinohara's Algorithm for Computing Descriptive (Angluin-Style) Patterns to Subsequence Patterns
Markus L. Schmid
The introduction of pattern languages in the seminal work [Angluin, ``Finding Patterns Common to a Set of Strings'', JCSS 1980] has revived the classical model of inductive inferen…
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…