13 search results - page 1 / 3 » Pattern Matching Algorithms with Don't Cares |
SOFSEM
2007
Springer
13 years 11 months ago
2007
Springer
JCSS
2010
13 years 3 months ago
2010
We present solutions for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols and a bound k...
COCOON
2006
Springer
13 years 9 months ago
2006
Springer
In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gap...
DIS
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We propose a new string kernel based on variable-lengthdon't-care patterns (VLDC patterns). A VLDC pattern is an element of ({}) , where is an alphabet and is the ...
IPL
2007
13 years 5 months ago
2007
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...