33 search results - page 4 / 7 » Compression of Strings with Approximate Repeats |
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
IJFCS
2006
14 years 9 months ago
2006
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
DAWAK
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Detecting repeated portions of strings has important applications to many areas of study including data compression and computational biology. This paper defines and pres...
SIGIR
1998
ACM
15 years 1 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
109
click to vote
TIP
2002
14 years 9 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...