1 citations · 1 across the 4 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
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★ 1 cited
Linear-time Computation of Minimal Absent Words Using Suffix Array
Carl Barton, Alice Heliou, Laurent Mouchard +1
An absent word of a word y of length n is a word that does not occur in y. It is a minimal absent word if all its proper factors occur in y. Minimal absent words have been computed…
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…