Sciweavers

33 search results - page 2 / 7
» Compression of Strings with Approximate Repeats
Sort
View
113
Voted
CPM
2000
Springer
175views Combinatorics» more  CPM 2000»
15 years 5 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...
93
Voted
CPM
2007
Springer
129views Combinatorics» more  CPM 2007»
15 years 7 months ago
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
Philip Bille, Rolf Fagerberg, Inge Li Gørtz
100
Voted
SPIRE
2000
Springer
15 years 4 months ago
Bit-Parallel Approach to Approximate String Matching in Compressed Texts
Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, A...
83
Voted
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
15 years 1 months ago
Compressed Indexes for Approximate String Matching
Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lun...
92
Voted
ALGORITHMICA
2008
71views more  ALGORITHMICA 2008»
15 years 22 days ago
Improved Approximate String Matching Using Compressed Suffix Data Structures
Tak Wah Lam, Wing-Kin Sung, Swee-Seong Wong