Sciweavers

CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
13 years 8 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
SPIRE
2001
Springer
13 years 9 months ago
On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs
The Compact Directed Acyclic Word Graph (CDAWG) is a space efficient data structure that supports indices of a string. The Symmetric Directed Acyclic Word Graph (SCDAWG) for a st...
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohar...
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...
CPM
2004
Springer
87views Combinatorics» more  CPM 2004»
13 years 10 months ago
A Trie-Based Approach for Compacting Automata
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
Maxime Crochemore, Chiara Epifanio, Roberto Grossi...