String pattern discovery

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3244, Issue , 2004, Pages 1-13

  Shinohara, Ayumi ^a,b  

^a KYUSHU UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; HTML; LEARNING SYSTEMS; PATTERN RECOGNITION; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; SET THEORY; XML; COMPUTERS;

KNOWLEDGE DISCOVERY; PATTERN DISCOVERY; PROBABLY APPROXIMATELY CORRECT (PAC) LEARNING MODEL; STRING PROCESSING; CRITICAL TASKS; PATTERN CLASS;

KNOWLEDGE ENGINEERING; ARTIFICIAL INTELLIGENCE;

EID: 22944436159     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30215-5_1     Document Type: Conference Paper

References (37)

1. R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. of the 11th International Conference on Data Engineering, Mar. 1995.
2. D. Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, 1988.
3. H. Arimura, S. Arikawa, and S. Shimozono. Efficient discovery of optimal word-association patterns in large text databases. New Generation Computing, 18:49-60, 2000.
4. H. Arimura, H. Asaka, H. Sakamoto, and S. Arikawa. Efficient discovery of proximity patterns with suffix arrays (extended abstract). In Proc. the 12th Annual Symposium on Combinatorial Pattern Matching (CPM'01), volume 2089 of Lecture Notes in Computer Science, pages 152-156. Springer-Verlag, 2001.
5. R. A. Baeza-Yates. Searching subsequences. Theoretical Computer Science, 78(2):363-376, Jan. 1991.
6. H. Bannai, H. Hyyrö, A. Shinohara, M. Takeda, K. Nakai, and S. Miyano. Finding optimal pairs of patterns. In Proc. 4th Workshop on Algorithms in Bioinformatics (WABI2004), Lecture Notes in Computer Science. Springer-Verlag, 2004. (to appear).
7. H. Bannai, S. Inenaga, A. Shinohara, M. Takeda, and S. Miyano. More speed and more pattern variations for knowledge discovery system BONSAI. Genome Informatics, 12:454-455, 2001.
8. H. Bannai, S. Inenaga, A. Shinohara, M. Takeda, and S. Miyano. A string pattern regression algorithm and its application to pattern discovery in long introns. Genome Informatics, 13:3-11, 2002.
9. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Occam's razor. Inf. Process. Lett., 24:377-380, 1987.
10. A. Blumer, A. Ehrenheucht, D. Haussler, and M. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of ACM, 36:929-965, 1989.
11. R. Board and L. Pitt. On the necessity of Occam algorithms. Theoretical Computer Science, 100:157-184, 1992.
12. A. Califano. SPLASH: Structural pattern localization analysis by sequential histograms. Bioinformatics, Feb. 1999.
13. R. Feldman, Y. Aumann, A. Amir, A. Zilberstein, and W. Klosgen. Maximal association rules: A new tool for mining for keyword co-occurrences in document collections. In Proc. of the 3rd International Conference on Knowledge Discovery and Data Mining, pages 167-170. AAAI Press, Aug. 1997.
14. E. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
15. M. Hirao, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. A practical algorithm to find the best subsequence patterns. In Proc. 3rd International Conference on Discovery Science (DS2000), volume 1967 of Lecture Notes in Artificial Intelligence, pages 141-154. Springer-Verlag, Dec. 2000.
16. (Journal version is published in Theoretical Computer Science, Vol. 292, pp. 465-479, 2003).
17. M. Hirao, S. Inenaga, A. Shinohara, M. Takeda, and S. Arikawa. A practical algorithm to find the best episode patterns. In Proc. of The Fourth International Conference on Discovery Science (DS2001), Lecture Notes in Artificial Intelligence. Springer-Verlag, Nov. 2001.
18. H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. Online construction of subsequence automata for multiple texts. In Proc. of 7th International Symposium on String Processing and Information Retrieval (SPIRE2000), pages 146-152. IEEE Computer Society, Sept. 2000.
19. S. Inenaga, H. Bannai, H. Hyyrö, A. Shinohara, M. Takeda, K. Nakai, and S. Miyano. Finding optimal pairs of cooperative and competing patterns with bounded distance. In Proc. 7th International Conference on Discovery Science (DS2004), Lecture Notes in Computer Science. Springer-Verlag, 2004. (to appear).
20. S. Inenaga, H. Bannai, A. Shinohara, M. Takeda, and S. Arikawa. Discovering best variable-length-don't-care patterns. In Proc. 5th International Conference on Discovery Science (DS2002), volume 2534 of Lecture Notes in Computer Science, pages 86-97. Springer-Verlag, 2002.
21. S. Inenaga, M. Takeda, A. Shinohara, H. Bannai, and S. Arikawa. Space-economical construction of index structures for all suffixes of a string. In Proc. 27th Inter. Symp. on Mathematical Foundation of Computer Science (MFCS2002), volume 2420 of Lecture Notes in Computer Science, pages 341-352. Springer-Verlag, Aug. 2002.
22. S. Inenaga, M. Takeda, A. Shinohara, H. Hoshino, and S. Arikawa. The minimum dawg for all suffixes of a string and its applications. In Proc. 13th Ann. Symp. on Combinatorial Pattern Matching (CPM2002), volume 2373 of Lecture Notes in Computer Science, pages 153-167. Springer-Verlag, July 2002.
23. 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. ACM Press, 1991.
24. M. Kearns and U. Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.
25. L. Marsan and M.-F. Sagot. Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. J. Comput. Biol., 7:345-360, 2000.
26. 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.
27. S. Miyano, A. Shinohara, and T. Shinohara. Which classes of elementary formal systems are polynomial-time learnable? In Proc. 2nd Workshop on Algorithmic Learning Theory (ALT91), pages 139-150, 1991.
28. S. Miyano, A. Shinohara, and T. Shinohara. Polynomial-time learning of elementary formal systems. New Generation Computing, 18:217-242, 2000.
29. S. Morishita and J. Sese. Traversing itemset lattices with statistical metric pruning. In Proc. of the 19th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 226-236. ACM Press, May 2000.
30. B. Natarajan. On learning sets and functions. Machine Learning, 4(1):67-97, 1989.
31. L. Palopoli and G. Terracina. Discovering frequent structured patterns from string databases: an application to biological sequences. In Proc. 5th International Conference on Discovery Science (DS2002), volume 2534 of Lecture Notes in Computer Science, pages 34-46. Springer-Verlag, 2002.
32. 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.
33. M. Takeda, S. Inenaga, H. Bannai, A. Shinohara, and S. Arikawa. Discovering most classificatory patterns for very expressive pattern classes. In Proc. 6th International Conference on Discovery Science (DS2003), volume 2843 of Lecture Notes in Computer Science, pages 486-493, Springer-Verlag, 2003.
34. Z. Troníček. Episode matching. In Proc. of 12th Annual Symposium on Combinatorial Pattern Matching, volume 2089 of Lecture Notes in Computer Science, pages 143-146. Springer-Verlag, July 2001.
35. Z. Troníčk and A. Shinohara. The size of subsequence automaton. In Proc. of 10th International Symposium on String Processing and Information Retrieval (SPIRE2003), volume 2857, pages 304-310. Springer-Verlag, 2003.
36. L. G. Valiant. A theory of the learnable. Communications of ACM, 27:1134-1142, 1984.
37. J. T. L. Wang, G.-W. Chirn, T. G. Marr, B. A. Shapiro, D. Shasha, and K. Zhang. Combinatorial pattern discovery for scientific data: Some preliminary results. In Proc. of the 1994 ACM SIGMOD International Conference on Management of Data, pages 115-125. ACM Press, May 1994.