7 citations · 13 across the 25 of their papers we have counts for
Showing 2014 · cs.DSShow all
3 papers · 2 filters
cs.DS2014
Covering Problems for Partial Words and for Indeterminate Strings
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +3
We consider the problem of computing a shortest solid cover of an indeterminate string. An indeterminate string may contain non-solid symbols, each of which specifies a subset of t…
cs.DS2014
On the Average-case Complexity of Pattern Matching with Wildcards
Carl Barton
Pattern matching with wildcards is the problem of finding all factors of a text of length that match a pattern of length , where wildcards (characters that match eve…
cs.DS2014
Average-Case Optimal Approximate Circular String Matching
Carl Barton, Costas S. Iliopoulos, Solon P. Pissis
Approximate string matching is the problem of finding all factors of a text t of length n that are at a distance at most k from a pattern x of length m. Approximate circular string…