Sciweavers

3 search results - page 1 / 1
» Disjoint pattern matching and implication in strings
Sort
View
IPL
2010
107views more  IPL 2010»
13 years 4 months ago
Disjoint pattern matching and implication in strings
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...
Leonid Libkin, Cristina Sirangelo
FCCM
2009
IEEE
139views VLSI» more  FCCM 2009»
13 years 3 months ago
Memory-Efficient Pipelined Architecture for Large-Scale String Matching
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...
Yi-Hua Edward Yang, Viktor K. Prasanna
CPM
2000
Springer
124views Combinatorics» more  CPM 2000»
13 years 10 months ago
Indexing Text with Approximate q-Grams
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...
Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jor...