17 search results - page 3 / 4 » Approximate String Matching over Ziv-Lempel Compressed Text |
103
click to vote
IFIPTCS
2000
15 years 3 months ago
2000
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
189
click to vote
FCCM
2011
IEEE
14 years 3 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
126
Voted
WEA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
ISPAN
1997
IEEE
15 years 3 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
JDA
2007
14 years 11 months ago
2007
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...