On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics

Volumn 146, Issue 2, 2005, Pages 156-179

  Inenaga, Shunsuke ^a,b   Hoshino, Hiromasa ^a   Shinohara, Ayumi ^a,b   Takeda, Masayuki ^a,b   Arikawa, Setsuo ^a   Mauri, Giancarlo ^c   Pavesi, Giulio ^c  

^a KYUSHU UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^c UNIVERSITY OF MILANO BICOCCA   (Italy)

Author keywords

Compact directed acyclic word graphs; Directed acyclic word graphs; On line and linear time algorithms; Pattern matching on strings; Suffix trees

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; DATA MINING; LINEAR SYSTEMS; ONLINE SYSTEMS; OPTIMIZATION; PATTERN MATCHING; TREES (MATHEMATICS);

COMPACT DIRECTED ACYCLIC WORD GRAPHS; DIRECTED ACYCLIC GRAPHS; ON-LINE AND LINEAR-TIME ALGORITHMS; PATTERN MATCHING ON STRINGS; SUFFIX TREES;

GRAPH THEORY;

EID: 11844280287     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.04.012     Document Type: Conference Paper

References (36)

1. A. Apostolico, The myriad virtues of subword trees, in: Combinatorial Algorithm on Words, NATO Advanced Science Institutes Series F, vol. 12, Springer, Berlin, 1985, pp. 85-96.
2. A. Apostolico, and S. Lonardi A speed-up for the commute between subword trees and DAWGs Inform. Process. Lett. 83 3 2002 159 161
3. M. Balík, Implementation of DAWG, in: Proceedings of the Prague Stringology Club Workshop '98 (PSCW'98), Czech Technical University, 1998, pp. 26-35.
4. 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 1985 31 55
5. A. Blumer, J. Blumer, D. Haussler, R. McConnell, and A. Ehrenfeucht Complete inverted files for efficient text retrieval and analysis J. Assoc. Comput. Mach. 34 3 1987 578 595
6. M.T. Chen, J. Seiferas, Efficient and elegant subword tree construction, in: Combinatorial Algorithm on Words, NATO Advanced Science Institutes, Series F, vol. 12, Springer, Berlin, 1985, pp. 97-107.
7. J.G. Cleary, W.J. Teahan, and I.H. Witten Unbounded length contexts for PPM Proceedings of the Data Compression Conference '95 (DCC'95) IEEE Computer Society, Silver Spring, MD 1995 52 61
8. J.G. Cleary, and I.H. Witten Data compression using adaptive coding and partial string matching IEEE Trans. Comm. 32 4 1984 396 402
9. M. Crochemore Transducers and repetitions Theoret. Comput. Sci. 45 1986 63 86
10. M. Crochemore Reducing space for index implementation Theoret. Comput. Sci. 292 1 2003 185 197
11. M. Crochemore, and W. Rytter Text Algorithms 1994 Oxford University Press New York
12. M. Crochemore, and W. Rytter Jewels of Stringology 2002 World Scientific Singapore
13. M. Crochemore, R. Vérin, On compact directed acyclic word graphs, in: Structures in Logic and Computer Science, Lecture Notes in Computer Science, vol. 1261, Springer, Berlin, 1997, pp. 192-211.
14. G. Gonnet, R. Baeza-Yates, T. Snider, New indices for text: PAT trees and PAT arrays, Information Retrieval: Data Structures and Algorithms, 1992, pp. 66-82.
15. R. Grossi, and J.S. Vitter Compressed suffix arrays and suffix trees with applications to text indexing and string matching Proceedings of 32nd ACM Symposium on Theory of Computing (STOC'00) 2000 397 406
16. D. Gusfield Algorithms on Strings, Trees, and Sequences 1997 Cambridge University Press New York
17. J. Holub, and B. Melichar Approximate string matching using factor automata Theoret. Comput. Sci. 249 2000 305 311
18. S. Inenaga Bidirectional construction of suffix trees Nordic J. Comput. 10 1 2003 52 67
19. S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa Construction of the CDAWG for a trie Proceedings of the Prague Stringology Conference '01 (PSC'01) Czech Technical University 2001 37 48
20. S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa, On-line construction of compact directed acyclic word graphs, Technical Report DOI-TR-CS-183, Department of Informatics, Kyushu University, 2001.
21. S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa On-line construction of symmetric compact directed acyclic word graphs Proceedings of the Eighth International Symposium on String Processing and Information Retrieval (SPIRE'01) IEEE Computer Society, Silver Spring, MD 2001 96 110
22. S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa, Unification of algorithms to construct index structures for texts, Technical Report DOI-TR-CS-196, Department of Informatics, Kyushu University, 2001.
23. S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa, G. Mauri, G. Pavesi, On-line construction of compact directed acyclic word graphs, in: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching (CPM'01), Lecture Notes in Computer Science, vol. 2089, Springer, Berlin, 2001, pp. 169-180.
24. S. Inenaga, A. Shinohara, M. Takeda, S. Arikawa, Compact directed acyclic word graphs for a sliding window, in: Proceedings of the Ninth International Symposium on String Processing and Information Retrieval (SPIRE'02), Lecture Notes in Computer Science, vol. 2476, Springer, Berlin, 2002, pp. 310-324.
25. J. Kärkkäinen, Suffix cactus: a cross between suffix tree and suffix array, in: Proceedings of the Sixth Annual Symposium on Combinatorial Pattern Matching (CPM'95), Lecture Notes in Computer Science, vol. 973, Springer, Berlin, 1995, pp. 191-204.
26. S.R. Kosaraju Fast pattern matching in trees Proceedings of the 30th IEEE Symposium on Foundations of Computer Science 1989 178 183
27. S. Kurtz Reducing the space requirement of suffix trees Software - Practice Experience 29 13 1999 1149 1171
28. V. Mäkinen Compact suffix array - a space-efficient full-text index Fund. Inform. 56 1-2 2003 191 210
29. U. Manber, and G. Myers Suffix arrays a new method for on-line string searches SIAM J. Comput. 22 5 1993 935 948
30. E.M. McCreight A space-economical suffix tree construction algorithm J. Assoc. Comput. Math. 23 2 1976 262 272
31. K. Sadakane, Compressed text databases with efficient query algorithms based on the compressed suffix array, in: Proceedings of the 11th International Symposium on Algorithms and Computation (ISAAC'00), Lecture Notes in Computer Science, vol. 1969, Springer, Berlin, 2000, pp. 410-421.
32. M. Takeda, T. Matsumoto, T. Fukuda, and I. Nanri Discovering characteristic expressions from literary works Theoret. Comput. Sci. 292 2 2003 525 546
33. E. Ukkonen, Approximate string matching over suffix trees, in: Proceedings of the Fourth Annual Symposium on Combinatorial Pattern Matching (CPM'93), Lecture Notes in Computer Science, vol. 684, Springer, Berlin, 1993, pp. 228-242.
34. E. Ukkonen On-line construction of suffix trees Algorithmica 14 3 1995 249 260
35. E. Ukkonen, and D. Wood Approximate string matching with suffix automata Algorithmica 10 5 1993 353 364
36. P. Weiner Linear pattern matching algorithms Proceedings of the 14th Annual Symposium on Switching and Automata Theory 1973 1 11