The Minimum DAWG for All Suffixes of a String and Its Applications.
Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings,
Lecture Notes in Computer Science Vol.2373, pp.153-167
(2002), [peer-reviewed]
Event Date:
July 3-5, 2002
Abstract / 概要
For a string w over an alphabet Σ, we consider a composite data structure called the all-suffixes directed acyclic word graph (ASDAWG). ASDAWG(w) has |w| + 1 initial nodes, and the dag induced by all reachable nodes from the k-th initial node conforms with…