On-Line Construction of Compact Directed Acyclic Word Graphs

Authors:
Shunsuke Inenaga;Hiromasa Hoshino;Ayumi Shinohara;Masayuki Takeda;Setsuo Arikawa;Giancarlo Mauri;Giulio Pavesi
Affiliations:
-;-;-;-;-;-;-
Venue:
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Year:
2001

Citing 5
Cited 14

Complete inverted files for efficient text retrieval and analysis

Journal of the ACM (JACM)
Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
On Compact Directed Acyclic Word Graphs

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht

Space-Economical Construction of Index Structures for All Suffixes of a String

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Compact Directed Acyclic Word Graphs for a Sliding Window

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
The Minimum DAWG for All Suffixes of a String and Its Applications

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Bidirectional construction of suffix trees

Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
SPINE: Putting Backbone into String Indexing

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Compact directed acyclic word graphs for a sliding window

Journal of Discrete Algorithms - SPIRE 2002
Ternary directed acyclic word graphs

Theoretical Computer Science - Implementation and application of automata
On Sturmian graphs

Discrete Applied Mathematics
On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics
On the implementation of compact DAWG's

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Ternary directed acyclic word graphs

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Suffix tree based data compression

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Sturmian graphs and a conjecture of moser

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Compact Directed Acyclic Word Graph (CDAWG) is a space-efficient text indexing structure, that can be used in several different string algorithms, especially in the analysis of biological sequences. In this paper, we present a new on-line algorithm for its construction, as well as the construction of a CDAWG for a set of strings.