48 search results - page 6 / 10 » Direct Pattern Matching on Compressed Text |
135
Voted
ESA
2011
Springer
14 years 26 days ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
116
Voted
STACS
2009
Springer
15 years 8 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
117
click to vote
IR
2000
15 years 28 days ago
2000
Inverted index compression, block addressing and sequential search on compressed text are three techniques that have been separately developed for e cient, low-overhead text retrie...
122
Voted
IFIPTCS
2000
15 years 4 months ago
2000
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
100
Voted
SPIRE
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...