Directed acyclic word graph

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In computer science, a directed acyclic word graph (DAWG) is a data structure that represents the set of suffixes of a string. As its name implies, a DAWG takes the form of a directed acyclic graph.

See also[edit]

References[edit]