On-line construction of symmetric compact directed acyclic word graphs

Proceedings - 8th Symposium on String Processing and Information Retrieval, SPIRE 2001

Volumn , Issue , 2001, Pages 96-110

  Inenaga, Shunsuke ^a   Hoshino, Hiromasa ^a   Shinohara, Ayumi ^a   Takeda, Masayuki ^a,b   Arikawa, Setsuo ^a  

^a KYUSHU UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); INFORMATION RETRIEVAL;

COMPACT DIRECTED ACYCLIC WORD GRAPHS; DIRECTED ACYCLIC WORD GRAPHS; ON-LINE ALGORITHMS; SPACE EFFICIENT;

DIRECTED GRAPHS;

EID: 84963850932     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.2001.989743     Document Type: Conference Paper

References (16)

1. A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. T. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci., 40:31-55, 1985.
2. A. Blumer, J. Blumer, D. Haussler, R. Mc-Connell, and A. Ehrenfeucht. Complete inverted files for efficient text retrieval and analysis. J. ACM, 34(3):578-595, 1987. Preliminary version in: STOC'84.
3. M. T. Chen and J. Seiferas. Efficient and elegant subword tree construction. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithm on Words, volume 12 of NATO Advanced Science Institutes, Series F, pages 97-107. Springer-Verlag, 1985.
4. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, New York, 1994.
5. M. Crochemore and R. Vérin. On compact directed acyclic word graphs. In Structures in Logic and Computer Science (LNCS1261), pages 192-211. Springer-Verlag, 1997.
6. R. Giegerich and S. Kurtz. From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction. Algorithmica, 19(3):331-353, 1997.
7. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York, 1997.
8. J. Holub and B. Melichar. Approximate string matching using factor automata. Theor. Comput. Sci., 249:305-311, 2000.
9. S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa, G. Mauri, and G. Pavesi. On-line construction of compact directed acyclic word graphs. In Proc. 12th Ann. Symp. on Combinatorial Pattern Matching (LNCS2089), pages 169-180, July 2001.
10. M. G. Maaß. Linear bidirectional on-line construction of affix trees. In Proc. 11th Ann. Symp. on Combinatorial Pattern Matching (LNCS1848), pages 320-334. Springer-Verlag, 2000.
11. E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23(2):262-272, Apr. 1976.
12. J. Stoye. Affixbäume. Master's thesis, Universität Bielefeld, May 1995.
13. J. Stoye. Affix trees. Technical Report 2000-4, Universität Bielefeld, Technische Fakultät, 2000.
14. M. Takeda, T. Matsumoto, T. Fukuda, and I. Nanri. Discovering characteristic expressions from literary works: A new text analysis method beyond n-gram and KWIC. Theor. Comput. Sci., 2001. (to appear).
15. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, 1995.
16. P. Weiner. Linear pattern matching algorithms. In Proc. 14th Ann. Symp. on Switching and Automata Theory, pages 1-11, Oct. 1973.