Online construction of subsequence automata for multiple texts

Proceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000

Volumn , Issue , 2000, Pages 146-152

  Hoshino, H ^a   Shinohara, A ^a   Takeda, M ^a   Arikawa, S ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC FINITE AUTOMATA; ON-LINE ALGORITHMS; PREPROCESS; SUBSEQUENCE AUTOMATON; TOTAL LENGTH; UPPER BOUND;

INFORMATION RETRIEVAL;

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

References (15)

1. R. A. Baeza-Yates. Searching subsequences. Theoretical Computer Science, 78(2):363-376, Jan. 1991.
2. M. Crochemore and Z. Troníček. Directed acyclic subsequence graph for multiple texts. Technical Report IGM-99-13, Institut Gaspard-Monge, June 1999.
3. G. Das, R. Fleischer, L. Gasieniek, D. Gunopulos, and J. Kärkkäinen. Episode matching. In A. Apostolico and J. Hein, editors, Proc. of the 8th Annual Symposium on Combinatorial Pattern Matching, volume 1264 of Lecture Notes in Computer Science, pages 12-27. Springer-Verlag, 1997.
4. M. Hirao, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. A practical algorithm to find best subsequence patterns. Technical Report DOI-TR-CS-175, Department of Informatics, Kyushu University, June 2000.
5. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
6. T. Jiang and M. Li. On the complexity of learning strings and sequences. In Proc. of 4th ACM Conf. Computational Learning Theory, pages 367-371, 1991.
7. D. Maier. The complexity of some problems on subsequences and supersequences. J. ACM, 25:322-336, Apr. 1978.
8. H. Mannila, H. Toivonen, and A. I. Vercamo. Discovering frequent episode in sequences. In Proc. of the 1st International Conference on Knowledge Discovery and Data Mining, pages 210-215. AAAI Press, Aug. 1995.
9. S. Matsumoto and A. Shinohara. Learning subsequence languages. In H. Kangassalo et al., editor. Information Modeling and Knowledge Bases, VIII, pages 335-344. IOS Press, 1997.
10. S. Miyano, A. Shinohara, and T. Shinohara. Which classes of elementary formal systems are polynomial-time learnable? In Proc. of 2nd Workshop on Algorithmic Learning Theory, pages 139-150, 1991.
11. J. R. Quinlan. Induction of decision trees. Machine Learning, 1:81-106, 1986.
12. D. Revuz. Minimization of acyclic deterministic automata in linear time. Theoretical Computer Science, 92(1):181-189, Jan. 1992.
13. S. Shimozono, A. Shinohara, T. Shinohara, S. Miyano, S. Kuhara, and S. Arikawa. Knowledge acquisition from amino acid sequences by machine learning system BONSAI. Transactions of Information Processing Society of Japan, 35(10):2009-2018, Oct. 1994.
14. Z. Troníček. Problems related to subsequences and supersequences. In Proc. of 6th International Symposium on String Processing and Information Retrieval, pages 199-205. IEEE Computer Society, 1999.
15. Z. Troníček and B. Melichar. Directed acyclic subsequence graph. In Proc. of the Prague Stringology Club Workshop'98, pages 107-118, Sept. 1998.