99 search results - page 7 / 20 » Speeding Up Pattern Matching by Text Compression |
ISPAN
1997
IEEE
15 years 1 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
SPIRE
2009
Springer
15 years 4 months ago
2009
Springer
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
103
click to vote
DAGSTUHL
2006
14 years 10 months ago
2006
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
DAWAK
2005
Springer
15 years 3 months ago
2005
Springer
This paper proposes the compression of data in Relational Database Management Systems (RDBMS) using existing text compression algorithms. Although the technique proposed is general...
WEA
2007
Springer
15 years 3 months ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...