Mining maximal flexible patterns in a sequence

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

Volumn 4914 LNAI, Issue , 2008, Pages 307-317

  Arimura, Hiroki ^a   Uno, Takeaki ^b  

^a HOKKAIDO UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CYBERNETICS; DATABASE SYSTEMS; LEARNING ALGORITHMS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SET THEORY;

ANNUAL CONFERENCE; DEPTH FIRST SEARCH ALGORITHMS; EQUIVALENCE CLASS; FLEXIBLE PATTERNS; INPUT SEQUENCE; POLYNOMIAL SPACES; SEQUENCE DATABASES;

EQUIVALENCE CLASSES;

EID: 49949090523     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78197-4_29     Document Type: Conference Paper

References (12)

1. Avis, D., Fukuda, K.: Reverse Search for Enumeration. Discrete Appl. Math. 65, 21-46 (1996)
2. Arimura, H., Fujino, R., Shinohara, T.: Protein motif discovery from positive examples by minimal multiple generalization over regular patterns. In: Proc. GIW 1994, pp. 39-48 (1994)
3. Arimura, H., Shinohara, T., Otsuki, S.: Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 649-660. Springer, Heidelberg (1994)
4. Arimura, H., Uno, T.: A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, Springer, Heidelberg (2005)
5. Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Min. Knowl. Discov. 1(3), 259-289 (1997)
6. Parida, L., Rigoutsos, I., et al.: Pattern discovery on character sets and real-valued data: Linear-bound on irredandant motifs and efficient polynomial time algorithms. In: Proc. SODA 2000, SIAM-ACM (2000)
7. Pisanti, N., et al.: A basis of tiling motifs for generating repeated patterns and its complexity of higher quorum. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, Springer, Heidelberg (2003)
8. Shapiro, E.Y.: Algorithmic Program Debugging. MIT Press, Cambridge (1982)
9. Shimozono, S., Arimura, H., Arikawa, S.: Efficient discovery of optimal wordassociation patterns in large text databases. New Generation Comput. 18(1), 49-60 (2000)
10. Shinohara, T.: Polynomial time inference of extended regular pattern Languages. In: Proc. RIMS Symp. on Software Sci. & Eng., pp. 115-127 (1982)
11. Yan, X., Han, J., Afshar, R.: CloSpan: Mining closed sequential patterns in large databases. In: Proc. SDM 2003, SIAM (2003)
12. Wang, J., Han, J.: BIDE: efficient mining of frequent closed sequences. In: Proc. ICDE 2004 (2004)