Measuring over-generalization in the minimal multiple generalizations of biosequences

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

Volumn 3735 LNAI, Issue , 2005, Pages 176-188

  Ng, Yen Kaow ^a   Ono, Hirotaka ^b   Shinohara, Takeshi ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); FORMAL LANGUAGES; SET THEORY; SIGNAL PROCESSING;

MINIMAL MULTIPLE GENERALIZATIONS (MMG); PATTERN LANGUAGES;

PATTERN RECOGNITION;

EID: 33745326763     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11563983_16     Document Type: Conference Paper

References (19)

1. D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21:46-62, 1980.
2. H. Arimura, R. Fujino, T. Shinohara, and S. Arikawa. Protein motif discovery from positive examples by Minimal Multiple Generalization over regular patterns. In Proceedings of the Genome Informatics Workshop, pages 39-48, 1994.
3. H. Arimura, T. Shinohara, and S. Otsuki. Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data. In Proc. of the 11th Ann. Symp. on Theoretical Aspects of Comp. Sci. (STACS'94), volume 775 of Lecture Notes in Computer Science, pages 649-660. Springer-Verlag, 1994.
4. A. Bairoch. PROSITE: A dictionary of sites and patterns in proteins. Nucl. Acids Res., 25(19):2241-2245, 1991.
5. D. A. Benson, I. Karsch-Mizrachi, D. J. Lipman, J. Ostell, and D. L. Wheeler. Genbank: update. Nucl. Acids Res., 32(Database-Issue):23-26, 2004.
6. A. Brazma, I. Jonassen, I. Eidhammer, and D. Gilbert, Approaches to the automatic discovery of patterns in biosequences. J. Comp. Biol., 5(2):277-304, 1998.
7. B. Brejova, T. Vinar, and M. Li. Pattern Discovery: Methods and Software, chapter 29, pages 491-522. Humana Press, 2003.
8. J. Case, S. Jain, R. Reischuk, F. Stephan, and T. Zeugmann. Learning a subclass of regular patterns in polynomial time. In R. Gavalda, K. P. Jantke, and E. Takimoto, editors, Algorithmic Learning Theory; Fourteenth International Conference (ALT' 03), volume 2842 of Lecture Notes in Artificial Intelligence, pages 234-246, 2003.
9. C. Chan, M. Garofalakis, and R. Rastogi, RE-tree; an efficient index structure for regular expressions. The VLDB Journal, 12(2); 102-119, 2003.
10. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
11. S. Kannan, Z. Sweedyk, and S. Mahaney. Counting and random generation of strings in regular languages. In Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, pages 551-557. Society for Industrial and Applied Mathematics, 1995.
12. Y. K. Ng and T. Shinohara. Inferring unions of the pattern languages by the most fitting covers. In Algorithmic Learning Theory: Sixteenth International Conference (ALT' 05). to appear.
13. H. Ono and Y. K. Ng. Best fitting fixed-length substring patterns for a set of strings. In Proceedings of The Eleventh International Computing and Combinatorics Conference (COCOON'05), to appear.
14. A. Shinohara. String pattern discovery. In Shai Ben-David, John Case, and Akira Maruoka, editors, Algorithmic Learning Theory; Fifteenth International Conference (ALT' 04), volume 3244 of Lecture Notes in Artificial Intelligence, pages 1-13, 2004.
15. T. Shinohara. Polynomial time inference of extended regular pattern languages. In RIMS Symposia on Software Science and Engineering, Kyoto, Japan, volume 147 of Lecture Notes in Computer Science, pages 115-127. Springer-Verlag, 1982.
16. T. Shinohara and Y. K. Ng. Strong biases for the minimal multiple generalization algorithm on samples of very small sizes. In The Proceedings of the 57th Meeting of SIG-FPAI (November 2004), The Japanese Society of Artificial Intelligence, 2004.
17. T. Takae, T. Kasai, H. Arimura, and T. Shinohara. Knowledge discovery in biosequences using sort regular patterns, Workshop on Applied Learning Theory, 1998.
18. J. Uemura and M. Sato. Compactness and learning of classes of unions of erasing regular pattern languages. In Algorithmic Learning Theory: Thirteenth International Conference (ALT' 02), volume 2533, pages 293-307. Springer-Verlag, 2002.
19. M. Yamaguchi, S. Shimozono, and T. Shinohara. Finding minimal multiple generalization over regular patterns with alphabet indexing. In Proceedings of the Seventh Workshop on Genome Informatics, volume 7, pages 51-60. Universal Academy Press, 1996.