Sciweavers

3270 search results - page 19 / 654
» Approximate String Processing
Sort
View
CPM
2000
Springer
175views Combinatorics» more  CPM 2000»
15 years 2 months ago
Approximate String Matching over Ziv-Lempel Compressed Text
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
Juha Kärkkäinen, Gonzalo Navarro, Esko U...
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
15 years 3 months ago
Increased Bit-Parallelism for Approximate String Matching
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...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
SIGMOD
2009
ACM
129views Database» more  SIGMOD 2009»
15 years 10 months ago
Incremental maintenance of length normalized indexes for approximate string matching
Marios Hadjieleftheriou, Nick Koudas, Divesh Sriva...
CPM
2007
Springer
124views Combinatorics» more  CPM 2007»
15 years 4 months ago
Cache-Oblivious Index for Approximate String Matching
Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Ta...