{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:25Z","timestamp":1725664465019},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609223"},{"type":"electronic","value":"9783540497233"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60922-9_19","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:03:56Z","timestamp":1330290236000},"page":"219-230","source":"Crossref","is-referenced-by-count":3,"title":["Extracting best consensus motifs from positive and negative examples"],"prefix":"10.1007","author":[{"given":"Erika","family":"Tateishi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osamu","family":"Maruyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoru","family":"Miyano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D., Finding patterns common to a set of strings, J. Comput. System Sci. 21 (1980) 46\u201362.","journal-title":"J. Comput. System Sci."},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF03037183","volume":"11","author":"S. Arikawa","year":"1993","unstructured":"Arikawa, S., Miyano, S., Shinohara, A., Kuhara, S., Mukouchi, Y., and Shinohara, T., A machine discovery from amino acid sequences by decision trees over regular patterns, New Generation Computing 11 (1993) 361\u2013375.","journal-title":"New Generation Computing"},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"2241","DOI":"10.1093\/nar\/19.suppl.2241","volume":"19","author":"A. Bairoch","year":"1991","unstructured":"Bairoch, A., PROSITE: a dictionary of sites and patterns in proteins, Nucleic Acids Res. 19 (1991) 2241\u20132245.","journal-title":"Nucleic Acids Res."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S. and Stockmeyer, L., Some simplified NP-complete problems, Theoret. Comput. Sci. 1 (1976) 237\u2013267.","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Gribskov, M. and Devereux, J., Sequence Analysis Primer, Stockholm Press, 1991.","DOI":"10.1007\/978-1-349-21355-9"},{"key":"19_CR6","unstructured":"Helgesen, C. and Sibbald, P.R., PALM \u2014 A pattern language for molecular biology, Proc. First International Conference on Intelligent Systems for Morecular Biology, 1993, 172\u2013180."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Jiang, T. and Li, M., On the complexity of learning strings and sequences, Proc. 4th Workshop on Computational Learning Theory, 1991, 367\u2013371.","DOI":"10.1016\/B978-1-55860-213-7.50036-5"},{"key":"19_CR8","unstructured":"Miyano, S., Shinohara, A. and Shinohara, T., Which classes of elementary formal systems are polynomial-time learnable?, Proc. Second Workshop on Algorithmic Learning Theory, 1991, 139\u2013150."},{"key":"19_CR9","unstructured":"Papadimitriou, C.H., Computational Complexity, Addison-Wesley, 1994."},{"key":"19_CR10","first-page":"81","volume":"1","author":"J.R. Quinlan","year":"1986","unstructured":"Quinlan, J.R., Induction on decision trees, Machine Learning 1 (1986) 81\u2013106.","journal-title":"Machine Learning"},{"key":"19_CR11","first-page":"2009","volume":"35","author":"S. Shimozono","year":"1994","unstructured":"Shimozono, S., Shinohara, A., Shinohara, T., Miyano, S., Kuhara, S., and Arikawa, S., Knowledge acquisition from amino acid sequences by machine learning system BONSAI, Transactions of Information Processing Society of Japan 35 (1994) 2009\u20132018.","journal-title":"Transactions of Information Processing Society of Japan"},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-11980-9_19","volume":"147","author":"T. Shinohara","year":"1983","unstructured":"Shinohara, T., Polynomial time inference of extended regular pattern languages, Lecture Notes in Computer Science 147 (1983) 115\u2013127.","journal-title":"Lecture Notes in Computer Science"},{"key":"19_CR13","unstructured":"Shoudai, T., Lappe, M., Miyano, S., Shinohara, A., Okazaki, T., Arikawa, S., Uchida, T., Shimozono, S., Shinohara, T., and Kuhara, S., BONSAI Garden: parallel knowledge discovery system for amino acid sequences, Proc. Third International Conference on Intelligent Systems for Molecular Biology (AAAI Press), 1995, 359\u2013366."},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Tateishi, E. and Miyano, S., A greedy strategy for finding motifs from positive and negative examples, to appear in Proc. First Pacific Symposium on Biocomputing, 1996.","DOI":"10.1007\/3-540-60922-9_19"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1006\/jagm.1994.1045","volume":"17","author":"M. Yannakakis","year":"1994","unstructured":"Yannakakis, M., On the approximation of maximum satisfiability, J. Algorithms 17 (1994) 475\u2013502.","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","STACS 96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60922-9_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:02:32Z","timestamp":1605646952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60922-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609223","9783540497233"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-60922-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}