{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T05:04:46Z","timestamp":1745643886917},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T00:00:00Z","timestamp":1151625600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1007\/s10994-006-9014-z","type":"journal-article","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T19:50:38Z","timestamp":1151697038000},"page":"229-245","source":"Crossref","is-referenced-by-count":28,"title":["An efficient top-down search algorithm for learning Boolean networks of gene expression"],"prefix":"10.1007","volume":"65","author":[{"given":"Dougu","family":"Nam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seunghyun","family":"Seo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sangsoo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,30]]},"reference":[{"key":"9014_CR1","doi-asserted-by":"crossref","unstructured":"Akutsu, T., Kuhara, S., & Miyano, S. (1999a). Identification of genetic networks from a small number of gene expression patterns under the Boolean network model. Proc. Pacific Symp. on Biocomputing \u201999, World Scientific, (pp. 17\u201328).","DOI":"10.1142\/9789814447300_0003"},{"key":"9014_CR2","unstructured":"Akutsu, T., Miyano, S., & Kuhara, S. (1999b). Fast identification of Boolean networks. Technical Report 99-AL-66, Information Processing Society of Japan: (pp. 25\u201332)."},{"issue":"3\/4","key":"9014_CR3","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1089\/106652700750050817","volume":"7","author":"T. Akutsu","year":"2000a","unstructured":"Akutsu, T., Miyano, S., & Kuhara, S. (2000a). Algorithms for identifying Boolean networks and related biological networks based on matrix multiplication and fingerprint function. J. Comp. Biol., 7(3\/4), 331\u2013343.","journal-title":"J. Comp. Biol."},{"issue":"8","key":"9014_CR4","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1093\/bioinformatics\/16.8.727","volume":"16","author":"T. Akutsu","year":"2000b","unstructured":"Akutsu, T., Miyano, S., & Kuhara, S. (2000b). Inferring qualitative relations in genetic networks and metabolic pathways. Bioinformatics, 16(8), 727\u2013734.","journal-title":"Bioinformatics"},{"issue":"2","key":"9014_CR5","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/S0304-3975(02)00183-4","volume":"292","author":"T. Akutsu","year":"2003","unstructured":"Akutsu, T., Miyano, S., & Kuhara, S. (2003). A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis. Theoretical Computer Science, 292(2), 481\u2013495.","journal-title":"Theoretical Computer Science"},{"key":"9014_CR6","doi-asserted-by":"crossref","unstructured":"Fukagawa, D., & Akutsu, T. (2003). Performance analysis of a greedy algorithm for inferring Boolean functions Discovery Science.","DOI":"10.1007\/978-3-540-39644-4_11"},{"key":"9014_CR7","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1089\/106652700750050961","volume":"9","author":"N. Friedman","year":"2000","unstructured":"Friedman, N., Linial, M., Nachman, I., & Pe\u2019er, D. (2000). Using Bayesian networks to analyze expression data. J. Comp. Biol., 9, 601\u2013620.","journal-title":"J. Comp. Biol."},{"key":"9014_CR8","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0022-5193(69)90015-0","volume":"22","author":"S.A. Kauffman","year":"1969","unstructured":"Kauffman, S.A. (1969). Metabolic stability and epigenesis in randomly constructed genetic nets. J. Theor. Biol., 22, 437\u2013466.","journal-title":"J. Theor. Biol."},{"key":"9014_CR9","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1126\/science.1075090","volume":"298","author":"T.I. Lee","year":"2002","unstructured":"Lee, T.I., Rinaldi, N.J., Robert, F., Odom, D.T., Bar-Joseph, Z., Gerber, G.K., Hannett, N.M., Harbison, C.T., Thompson, C.M., Simon, I., et al. (2002). Transcriptional regulatory networks in Saccharomyces cerevisiae, Science, 298, 799\u2013804.","journal-title":"Science"},{"key":"9014_CR10","unstructured":"Liang, S., Fuhrman, S., & Somogy, R. (1998). REVEAL. a general reverse engineering algorithm for inference of genetic network architectures. Proc. Pacific Symp. on Biocomputing \u201998, World Scientific, (pp. 18\u201329)."},{"key":"9014_CR11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1093\/bioinformatics\/18.2.261","volume":"18","author":"I. Shmulevich","year":"2002","unstructured":"Shmulevich, I., Dougherty, E. R., Kim, S. & Zhang, W. (2002). Probabilistic Boolean networks: a rule-based uncertainty model for gene regulatory networks. Bioinformatics, 18, 261\u2013274.","journal-title":"Bioinformatics"},{"key":"9014_CR12","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1006\/inco.1997.2687","volume":"140","author":"E. Boros","year":"1998","unstructured":"Boros, E., Ibaraki, T., & Makino, K. (1998). Error-Free and Best-Fit Extensions of partially defined Boolean functions. Information and Computation, 140, 254\u2013283.","journal-title":"Information and Computation"},{"key":"9014_CR13","doi-asserted-by":"crossref","unstructured":"L\u00e4hdesm\u00e4ki, H., Shmulevich, I., & Yli-Haria, O. (2003). On learning gene regulatory networks under the Boolean network model. Machine Learning, 52, 147\u2013167.","DOI":"10.1023\/A:1023905711304"},{"key":"9014_CR14","doi-asserted-by":"crossref","unstructured":"Stanley, R. P. (1997). Enumerative Combinatorics (vol. 1). Cambridge Press.","DOI":"10.1017\/CBO9780511805967"},{"key":"9014_CR15","unstructured":"Wilf, H. S. (1992). Generatingfunctionology. Academic Press."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-006-9014-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-006-9014-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-006-9014-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:40:22Z","timestamp":1559353222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-006-9014-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,30]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["9014"],"URL":"https:\/\/doi.org\/10.1007\/s10994-006-9014-z","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,30]]}}}