Direct construction of compact directed acyclic word graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1264, Issue , 1997, Pages 116-129

  Crochemore, Maxime ^a   Vérin, Renaud ^a  

^a Ecole Superieure d'Informatique et Genie des Telecommunications   (France)

Author keywords

Compact DAWG; DAWG; Index on text; Pattern matching algorithm; Suffix automaton; Suffix tree

Indexed keywords

CODES (SYMBOLS); DIRECTED GRAPHS; DNA SEQUENCES; PATTERN MATCHING;

COMPACT DAWG; DAWG; INDEX ON TEXT; PATTERN MATCHING ALGORITHMS; SUFFIX AUTOMATA; SUFFIX-TREES;

TREES (MATHEMATICS);

EID: 84947758465     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63220-4_55     Document Type: Conference Paper

References (14)

1. A. Anderson and S. Nilsson. Efficient implementation of suffix trees. Software, Practice and Experience, 25(2):129–141, Feb. 1995.
2. A. Apostolico. The myriad virtues of subword trees. In A. Apostolico & Z. Galil, editor, Combinatorial Algorithms on Words., pages 85–95. Springer-Verlag, 1985.
3. A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M.T. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theoret. Comput. Sci., 40:31–55, 1985.
4. A. Blumer, J. Blumer, D. Haussler, and R. McConnell. Complete inverted files for efficient text retrieval and analysis. Journal of the Association for Computing Machinery, 34(3):578–595, July 1987.
5. A. Blumer, D. Haussler, and A. Ehrenfeucht. Average sizes of suffix trees and dawgs. Discrete Applied Mathematics, 24:37–45, 1989.
6. B. Clift, D. Haussler, R. McDonnell, T.D. Schneider, and G.D. Stormo. Sequence landscapes. Nucleic Acids Research, 4(1):141–158, 1986.
7. M. Crochemore. Transducers and repetitions. Theor. Comp. Sci., 45:63–86, 1986.
8. M. Crochemore and W. Rytter. Text Algorithms, chapter 5–6, pages 73–130. Oxford University Press, New York, 1994.
9. R. W. Irving. Suffix binary search trees. Technical report TR-1995-7, Computing Science Department, University of Glasgow, April 1995.
10. J. Karkkainen. Suffix cactus: a cross between suffix tree and suffix array. CPM, 937:191–204, July 1995.
11. C. Lefevre and J-E. Ikeda. The position end-set tree: A small automaton for word recognition in biological sequences. CABIOS, 9(3):343–348, 1993.
12. U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. SIAM J. Comput., 22(5):935–948, Oct. 1993.
13. E. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262–272, Apr. 1976.
14. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14:249–260, 1995.