Sciweavers

3270 search results - page 19 / 654
» Approximate String Processing
Sort
View
180
Voted
CPM
2000
Springer
175views Combinatorics» more  CPM 2000»
15 years 10 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...
197
Voted
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
15 years 11 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...
223
Voted
SIGMOD
2009
ACM
129views Database» more  SIGMOD 2009»
16 years 6 months ago
Incremental maintenance of length normalized indexes for approximate string matching
Marios Hadjieleftheriou, Nick Koudas, Divesh Sriva...
126
Voted
CPM
2007
Springer
124views Combinatorics» more  CPM 2007»
16 years 16 days ago
Cache-Oblivious Index for Approximate String Matching
Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Ta...
157
Voted
CPM
2007
Springer
129views Combinatorics» more  CPM 2007»
16 years 16 days ago
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
Philip Bille, Rolf Fagerberg, Inge Li Gørtz