@inproceedings{6ec8550c7a8b456b8a40bda2837cf3e8,
title = "On-line construction of compact directed acyclic word graphs",
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.",
author = "Shunsuke Inenaga and Hiromasa Hoshino and Ayumi Shinohara and Masayuki Takeda and Setsuo Arikawa and Giancarlo Mauri and Giulio Pavesi",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 12th Annual Symposium on Combinatorial Pattern Matching, CPM 2001 ; Conference date: 01-07-2001 Through 04-07-2001",
year = "2001",
doi = "10.1007/3-540-48194-x_16",
language = "English",
isbn = "3540422714",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "169--180",
editor = "Amihood Amir and Amihood Amir and Landau, {Gad M.} and Landau, {Gad M.}",
booktitle = "Combinatorial Pattern Matching - 12th Annual Symposium, CPM 2001, Proceedings",
address = "Germany",
}