3 search results - page 1 / 1 » Disjoint pattern matching and implication in strings |
IPL
2010
14 years 10 months ago
2010
We deal with the problem of deciding whether a given set of string patterns implies the presence of a fixed pattern. While checking whether a set of patterns occurs in a string i...
101
click to vote
FCCM
2009
IEEE
14 years 9 months ago
2009
IEEE
We propose a pipelined field-merge architecture for memory-efficient and high-throughput large-scale string matching (LSSM). Our proposed architecture partitions the (8-bit) charac...
CPM
2000
Springer
15 years 4 months ago
2000
Springer
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...