Discovering unbounded unions of regular pattern languages from positive examples
- 1 January 1996
- book chapter
- Published by Springer Science and Business Media LLC
- p. 95-104
- https://doi.org/10.1007/bfb0009485
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Gibbs motif sampling: Detection of bacterial outer membrane protein repeatsProtein Science, 1995
- Finding flexible patterns in unaligned protein sequencesProtein Science, 1995
- Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive dataLecture Notes in Computer Science, 1994
- An Introduction to Kolmogorov Complexity and Its ApplicationsPublished by Springer Science and Business Media LLC ,1993
- Inferring decision trees using the minimum description lenght principleInformation and Computation, 1989
- Finding patterns common to a set of stringsJournal of Computer and System Sciences, 1980
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- Modeling by shortest data descriptionAutomatica, 1978
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- Language identification in the limitInformation and Control, 1967