64 search results - page 5 / 13 » Compression of Partially Ordered Strings |
DCC
2010
IEEE
14 years 3 months ago
2010
IEEE
We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
SPIRE
2001
Springer
14 years 1 months ago
2001
Springer
Thispaper describes speed-up of string pattern matchingby rearrangingstates inAho-Corasickpattern matching machine, which is a kind of afinite automaton. Werealized speed-up of st...
CGO
2003
IEEE
14 years 1 months ago
2003
IEEE
With the emergence of software delivery platforms such as Microsoft’s .NET, reduced size of transmitted binaries has become a very important system parameter strongly affecting ...
FOCS
2009
IEEE
14 years 13 days ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...