Sciweavers

180 search results - page 3 / 36
» Approximate Searching on Compressed Text
Sort
View
CPM
2001
Springer
98views Combinatorics» more  CPM 2001»
15 years 6 months ago
Regular Expression Searching over Ziv-Lempel Compressed Text
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
Gonzalo Navarro
CPM
2000
Springer
175views Combinatorics» more  CPM 2000»
15 years 6 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...
102
Voted
CPM
2007
Springer
129views Combinatorics» more  CPM 2007»
15 years 8 months ago
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
Philip Bille, Rolf Fagerberg, Inge Li Gørtz
SPIRE
2000
Springer
15 years 5 months ago
Bit-Parallel Approach to Approximate String Matching in Compressed Texts
Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, A...
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
15 years 3 months ago
Compressed Inverted Indexes for In-Memory Search Engines
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
Frederik Transier, Peter Sanders