论文信息 - Direct Construction of Compact Directed Acyclic Word Graphs

Direct Construction of Compact Directed Acyclic Word Graphs

The Directed Acyclic Word Graph (DAWG) is an efficient data structure to treat and analyze repetitions in a text, especially in DNA genomic sequences. Here, we consider the Compact Directed Acyclic Word Graph of a word. We give the first direct algorithm to construct it. It runs in time linear in the length of the string on a fixed alphabet. Our implementation requires half the memory space used by DAWGs.

Maxime Crochemore | Renaud Vérin | M. Crochemore | R. Vérin

[1] Arne Andersson,et al. Efficient implementation of suffix trees , 1995, Softw. Pract. Exp..

[2] Juha Kk,et al. Suux Cactus: a Cross between Suux Tree and Suux Array ? , 1995 .

[3] Maxime Crochemore,et al. Transducers and Repetitions , 1986, Theor. Comput. Sci..

[4] Xerox Polo,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976 .

[5] Christophe Lefèvre,et al. The position end-set tree: a small automaton for word recognition in biological sequences , 1993, Comput. Appl. Biosci..

[6] Esko Ukkonen,et al. On{line Construction of Suux Trees 1 , 1995 .

[7] Alberto Apostolico,et al. The Myriad Virtues of Subword Trees , 1985 .

[8] A. Falaschi,et al. Levels of DNA polymerase-alpha and beta in normal and xeroderma pigmentosum fibroblasts , 1977, Nucleic Acids Res..

[9] Juha Kärkkäinen. Suffix Cactus: A Cross between Suffix Tree and Suffix Array , 1995, CPM.

[10] David Haussler,et al. Complete inverted files for efficient text retrieval and analysis , 1987, JACM.

[11] David Haussler,et al. Average sizes of suffix trees and DAWGs , 1989, Discret. Appl. Math..

[12] Wojciech Rytter,et al. Text Algorithms , 1994 .

[13] Eugene W. Myers,et al. Suffix arrays: a new method for on-line string searches , 1993, SODA '90.

[14] David Haussler,et al. Sequence landscapes , 1986, Nucleic Acids Res..

[15] David Haussler,et al. The Smallest Automaton Recognizing the Subwords of a Text , 1985, Theor. Comput. Sci..