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.
Cite
CITATION STYLE
Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G., & Pavesi, G. (2001). On-line construction of compact directed acyclic word graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2089, pp. 169–180). Springer Verlag. https://doi.org/10.1007/3-540-48194-x_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
