{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:11:55Z","timestamp":1725455515831},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620488"},{"type":"electronic","value":"9783540496335"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0009485","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T10:32:17Z","timestamp":1129804337000},"page":"95-104","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Discovering unbounded unions of regular pattern languages from positive examples"],"prefix":"10.1007","author":[{"given":"Alvis","family":"Br\u0101zma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaak","family":"Vilo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,11]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"D. Angluin. Finding patterns common to a set of strings. J. of Comp. and Syst. Sci., 21:46\u201362, 1980.","journal-title":"J. of Comp. and Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"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\u2013660. Springer, 1994.","key":"10_CR2","DOI":"10.1007\/3-540-57785-8_178"},{"key":"10_CR3","volume-title":"Technical Report TR-113","author":"A. Brazma","year":"1995","unstructured":"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."},{"unstructured":"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\u201343. AAAI Press, 1996.","key":"10_CR4"},{"unstructured":"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.","key":"10_CR5"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"V. Chv\u00e1tal. A greedy heuristic for the set-covering problem. Math. Oper. Res., 4:233\u2013235, 1979.","journal-title":"Math. Oper. Res."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1967","unstructured":"E. M. Gold. Language identification in the limit. Information and Control, 10:447\u2013474, 1967.","journal-title":"Information and Control"},{"doi-asserted-by":"crossref","unstructured":"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\u2013243. Springer-Verlag, 1992.","key":"10_CR8","DOI":"10.1007\/3-540-56024-6_19"},{"issue":"8","key":"10_CR9","doi-asserted-by":"crossref","first-page":"1587","DOI":"10.1002\/pro.5560040817","volume":"4","author":"I. Jonassen","year":"1995","unstructured":"I. Jonassen, J. F. Collins, and D. G. Higgins. Finding flexible patterns in unaligned protein sequences. Protein Science, 4(8):1587\u20131595, 1995.","journal-title":"Protein Science"},{"doi-asserted-by":"crossref","unstructured":"P. Kilpel\u00e4inen, 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\u2013260, 1995.","key":"10_CR10","DOI":"10.1007\/3-540-59119-2_182"},{"doi-asserted-by":"crossref","unstructured":"M. Li and P. Vitanyi. An introduction to Kolmogorov complexity and its applications. Texts and monographs in Computer Science. Springer-Verlag, 1993.","key":"10_CR11","DOI":"10.1007\/978-1-4757-3860-5"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. M. McCreight","year":"1976","unstructured":"E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23:262\u2013272, 1976.","journal-title":"J. ACM"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"1618","DOI":"10.1002\/pro.5560040820","volume":"4","author":"A. F. Neuwald","year":"1995","unstructured":"A. F. Neuwald, J. S. Liu, and C. E. Lawrence. Gibbs motif sampling: Detection of bacterial outer membrane protein repeats. Protein Science, 4:1618\u20131632, 1995.","journal-title":"Protein Science"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0890-5401(89)90010-2","volume":"80","author":"J. R. Quinlan","year":"1989","unstructured":"J. R. Quinlan and R. L. Rivest. Inferring decision trees using the minimum decription length principle. Information and Computation, 80:227\u2013248, 1989.","journal-title":"Information and Computation"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"J. Rissanen. Modeling by the shortest data description. Automatica-J.IFAC, 14:465\u2013471, 1978.","journal-title":"Automatica-J.IFAC"},{"unstructured":"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\u2013331. AAAI Press, 1995.","key":"10_CR16"},{"doi-asserted-by":"crossref","unstructured":"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\u2013127. Springer-Verlag, 1983.","key":"10_CR17","DOI":"10.1007\/3-540-11980-9_19"},{"issue":"4","key":"10_CR18","first-page":"293","volume":"5","author":"R. Staden","year":"1989","unstructured":"R. Staden. Methods for discovering novel motifs in nucleic acid sequences. CABIOS, 5(4):293\u2013298, 1989.","journal-title":"CABIOS"},{"issue":"4","key":"10_CR19","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/S0092-8240(84)80056-7","volume":"46","author":"M. S. Waterman","year":"1984","unstructured":"M. S. Waterman, R. Arratia, and D. J. Galas. Pattern recognition in several sequences: Consensus and alignment. Bulletin of Mathematical Biology, 46(4):515\u2013527, 1984.","journal-title":"Bulletin of Mathematical Biology"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0009485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:06:44Z","timestamp":1578517604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0009485"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620488","9783540496335"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0009485","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"11 October 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}