Discovering unbounded unions of regular pattern languages from positive examples

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

Volumn 1178, Issue , 1996, Pages 95-104

  Brazma, Alvis ^a   Ukkonen, Esko ^b   Vilo, Jaak ^b  

^a UNIVERSITY OF LATVIA   (Latvia)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

MINIMUM DESCRIPTION LENGTH PRINCIPLE; PATTERN LANGUAGES; POSITIVE EXAMPLES; PROBABILISTIC MODELING; REGULAR PATTERNS; RUNNING TIME; SUBSTRING; UNBOUNDED UNIONS;

ARTIFICIAL INTELLIGENCE;

EID: 84990206939     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0009485     Document Type: Conference Paper

References (19)

1. D. Angluin. Finding patterns common to a set of strings. J. of Comp. and Syst. Sci., 21:46-62, 1980.
2. 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 STACS, Lecture Notes in Comp. Sci., 755, pages 649-660. Springer, 1994.
3. A. Brazma, I. Jonassen, I. Eidhammer, and D. Gilbert. Approaches to automatic discovery of patterns in biosequences. Technical Report TR-113, Department of Informatics, University of Bergen, Bergen, Norway, December 1995.
4. A. Brazma, I. Jonassen, E. Ukkonen, and J. Vilo. Discovering patterns and subfamilies in biosequences. In Proceedings of Fourth International Conference on Intelligent Systems for Molecular Biology, pages 34-43. AAAI Press, 1996.
5. A. Brazma, E. Ukkonen, and J. Vilo. Finding a good collection of patterns covering a set of sequences. Technical Report C-1995-60, Department of Computer Science, University of Helsinki, December 1995.
6. V. Chvátal A greedy heuristic for the set-covering problem. Math. Oper. Res., 4:233-235, 1979.
7. E. M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
8. L. C. K. Hui. Color set size problem with application to string matching. In Proc. of Third Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Comp. Science, 644, pages 230-243. Springer-Verlag, 1992.
9. I. Jonassen, J. F. Collins, and D. G. Higgins. Finding flexible patterns in unaligned protein sequences. Protein Science, 4(8):1587-1595, 1995.
10. P. Kilpeläinen, H. Mannila, and E. Ukkonen. MDL learning of unions of simple pattern languages from positive examples. In Proceedings of the 2nd European conference EuroCOLT’95, pages 252-260, 1995.
11. M. Li and P. Vitanyi. An introduction to Kolmogorov complexity and its applications. Texts and monographs in Computer Science. Springer-Verlag, 1993.
12. E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23:262-272, 1976.
13. A. F. Neuwald, J. S. Liu, and C. E. Lawrence. Gibbs motif sampling: Detection of bacterial outer membrane protein repeats. Protein Science, 4:1618-1632, 1995.
14. J. R. Quinlan and R. L. Rivest. Inferring decision trees using the minimum decription length principle. Information and Computation, 80:227-248, 1989.
15. J. Rissanen. Modeling by the shortest data description. Automatica-J.IFAC, 14:465-471, 1978.
16. M.-F. Sagot, A. Viari, and H. Soldano. A distance-based block searching algorithm. In Proc. of Third International Conference on Intelligent Systems for Molecular Biology, pages 322-331. AAAI Press, 1995.
17. T. Shinohara. Polynomial time inference of extended regular pattern languages. In Proceedings of RIMS Symposia on Software Science and Engineering, Lecture Notes in Computer Science, 147, pages 115-127. Springer-Verlag, 1983.
18. R. Staden. Methods for discovering novel motifs in nucleic acid sequences. CABIOS, 5(4):293-298, 1989.
19. M. S. Waterman, R. Arratia, and D. J. Galas. Pattern recognition in several sequences: Consensus and alignment. Bulletin of Mathematical Biology, 46(4):515-527, 1984.