Sciweavers

10 search results - page 1 / 2
» cpm 2001
Sort
View
CPM
1999
Springer
141views Combinatorics» more  CPM 1999»
13 years 9 months ago
Approximate Periods of Strings
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di...
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park,...
CPM
2001
Springer
98views Combinatorics» more  CPM 2001»
13 years 9 months ago
Regular Expression Searching over Ziv-Lempel Compressed Text
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
Gonzalo Navarro
CPM
2001
Springer
108views Combinatorics» more  CPM 2001»
13 years 9 months ago
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
Anne Bergeron
CPM
2001
Springer
130views Combinatorics» more  CPM 2001»
13 years 9 months ago
On-Line Construction of Compact Directed Acyclic Word Graphs
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohar...