Vérin, On Compact DirectedAcyclicWordGraphs, in (Structures in Logic and Computer Science, a selection of essays in honor of A. Ehrenfeucht, J. Mycielski, G. Rozenberg and A. Salomaa, eds., LNCS 1261, Springer-Verlag, 1997) pp 192--211.
The DirectedAcyclicWordGraph (DAWG) is a space-efficient data structure to treat and analyze repetitions in a text, especially in DNA genomic sequences.
Vérin, Direct construction of Compact DirectedAcyclicWordGraphs, in (CPM97, A. Apostolico and J. Hein, eds., LNCS 1264, Springer-Verlag, 1997) pp 116--129.
In computer science, a graph is an abstract data type (ADT) that consists of a set of nodes and a set of edges that establish relationships (connections) between the nodes.
In the general case, a graph may consist of many edges between many vertices, and unless the matrix representation for the edges is chosen, there may even be more than one edge connecting the same pair of vertices.
An example of an acyclicgraph is a directedacyclicwordgraph, a method of encoding a word-list for computer versions of word games such as Scrabble.
Feeds |
Contact