180 search results - page 8 / 36 » Approximate Searching on Compressed Text |
122
click to vote
CORR
2006
Springer
15 years 18 days ago
2006
Springer
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
224
Voted
ESA
2011
Springer
14 years 9 days ago
2011
Springer
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...
ITCC
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper we present StarNT, a dictionary-based fast lossless text transform algorithm. With a static generic dictionary, StarNT achieves a superior compression ratio than alm...
96
Voted
CSR
2006
Springer
15 years 4 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
223
Voted
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...