45 search results - page 3 / 9 » Compressed Indexes for Approximate String Matching |
JDA
2010
14 years 10 months ago
2010
103
click to vote
CPM
2000
Springer
15 years 4 months ago
2000
Springer
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...
SPIRE
2000
Springer
15 years 3 months ago
2000
Springer
88
Voted
ALGORITHMICA
2008
14 years 12 months ago
2008
83
Voted
CORR
2010
Springer
15 years 10 days ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...