514 search results - page 15 / 103 » Approximate Periods of Strings |
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
CPM
2000
Springer
14 years 7 days ago
2000
Springer
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
WEA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
CPM
2007
Springer
14 years 2 months ago
2007
Springer
