The minimum DAWG for all suffixes of a string and its applications

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

Volumn 2373, Issue , 2002, Pages 153-167

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

^a KYUSHU UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS;

APPLICATION PROBLEMS; DIRECTED ACYCLIC WORD GRAPHS; ITS APPLICATIONS; ON-LINE ALGORITHMS; RUNNING TIME;

PATTERN MATCHING;

EID: 23044534111     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45452-7_14     Document Type: Conference Paper

References (21)

1. D. Angluin. Finding patterns common to a set of strings. J. Comput. Sys. Sci., 21:46–62, 1980.
2. R. A. Baeza-Yates. Searching subsequences (note). Theoretical Computer Science, 78(2):363–376, Jan. 1991.
3. A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. T. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theoretical Computer Science, 40:31–55, 1985.
4. A. Blumer, J. Blumer, D. Haussler, R. McConnell, and A. Ehrenfeucht. Complete inverted files for efficient text retrieval and analysis. J. ACM, 34(3):578–595, 1987.
5. M. Crochemore. Transducers and repetitions. Theoretical Computer Science, 45:63–86, 1986.
6. M. Crochemore and Z. Troníćek. Directed acyclic subsequence graph for multiple texts. Technical Report IGM-99-13, Institut Gaspard-Monge, June 1999.
7. M. Crochemore and R. Vérin. On compact directed acyclic word graphs. In J. My-cielski, G. Rozenberg, and A. Salomaa, editors, Structures in Logic and Computer Science, volume 1261 of LNCS, pages 192–211. Springer-Verlag, 1997.
8. R. Grossi and J. S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proc. of 32nd ACM Symposium on Theory of Computing (STOC’00), pages 397–406, 2000.
9. M. Hirao, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. A practical algorithm to find the best subsequence patterns. In S. Arikawa and S. Morishita, editors, Proc. The Third International Conference on Discovery Science, volume 1967 of LNAI, pages 141–154. Springer-Verlag, 2000.
10. M. Hirao, S. Inenaga, A. Shinohara, M. Takeda, and S. Arikawa. A practical algorithm to find the best episode patterns. In K. P. Jantke and A. Shinohara, editors, Proc. The Fourth International Conference on Discovery Science, volume 2226 of LNAI, pages 435–440. Springer-Verlag, 2001.
11. 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 A. Amir and G. M. Landau, editors, Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM’01), volume 2089 of LNCS, pages 169–180. Springer-Verlag, 2001.
12. J. Kärkkäinen. Suffix cactus: A cross between suffix tree and suffix array. In Z. Galil and E. Ukkonen, editors, Proc. 6th Annual Symposium on Combinatorial Pattern Matching (CPM’95), volume 973 of LNCS, pages 191–204. Springer-Verlag, 1995.
13. V. Mśkinen. Compact suffix array. In R. Giancarlo and D. Sankoff, editors, Proc. 11th Annual Symposium on Combinatorial Pattern Matching (CPM’00), volume 1848 of LNCS, pages 305–319. Springer-Verlag, 2000.
14. U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. SIAM J. Compt., 22(5):935–948, 1993.
15. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovering frequent episode in sequences. In U. M. Fayyad and R. Uthurusamy, editors, Proc. 1st International Conference on Knowledge Discovery and Data Mining, pages 210–215. AAAI Press, Aug. 1995.
16. E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23(2):262–272, Apr. 1976.
17. D. Revuz. Minimization of acyclic deterministic automata in linear time. Theoretical Computer Science, 92(1):181–189, Jan. 1992.
18. K. Sadakane. Compressed text databases with efficient query algorithms based on the compressed suffix array. In Proc. of 11th International Symposium on Algorithms and Computation (ISAAC’00), volume 1969 of LNCS, pages 410–421. Springer-Verlag, 2000.
19. Z. Troníćek. Episode matching. In A. Amir and G. M. Landau, editors, Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM’01), volume 2089 of LNCS, pages 143–146. Springer-Verlag, 2001.
20. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249–260, 1995.
21. P. Weiner. Linear pattern matching algorithms. In Proc. 14th Annual Symposium on Switching and Automata Theory, pages 1–11, Oct. 1973.