{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T02:10:01Z","timestamp":1768529401622,"version":"3.49.0"},"reference-count":20,"publisher":"Oxford University Press (OUP)","issue":"17","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/about_us\/legal\/notices"}],"funder":[{"name":"Research Fund of University of Ulsan"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,9,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:sec>\n                  <jats:title>Motivation<\/jats:title>\n                  <jats:p>Inferring a gene regulatory network from time-series gene expression data is a fundamental problem in systems biology, and many methods have been proposed. However, most of them were not efficient in inferring regulatory relations involved by a large number of genes because they limited the number of regulatory genes or computed an approximated reliability of multivariate relations. Therefore, an improved method is needed to efficiently search more generalized and scalable regulatory relations.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Results<\/jats:title>\n                  <jats:p>In this study, we propose a genetic algorithm-based Boolean network inference (GABNI) method which can search an optimal Boolean regulatory function of a large number of regulatory genes. For an efficient search, it solves the problem in two stages. GABNI first exploits an existing method, a mutual information-based Boolean network inference (MIBNI), because it can quickly find an optimal solution in a small-scale inference problem. When MIBNI fails to find an optimal solution, a genetic algorithm (GA) is applied to search an optimal set of regulatory genes in a wider solution space. In particular, we modified a typical GA framework to efficiently reduce a search space. We compared GABNI with four well-known inference methods through extensive simulations on both the artificial and the real gene expression datasets. Our results demonstrated that GABNI significantly outperformed them in both structural and dynamics accuracies.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Conclusion<\/jats:title>\n                  <jats:p>The proposed method is an efficient and scalable tool to infer a Boolean network from time-series gene expression data.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Supplementary information<\/jats:title>\n                  <jats:p>Supplementary data are available at Bioinformatics online.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1093\/bioinformatics\/bty584","type":"journal-article","created":{"date-parts":[[2018,7,6]],"date-time":"2018-07-06T01:20:56Z","timestamp":1530840056000},"page":"i927-i933","source":"Crossref","is-referenced-by-count":64,"title":["A Boolean network inference from time-series gene expression data using a genetic algorithm"],"prefix":"10.1093","volume":"34","author":[{"given":"Shohag","family":"Barman","sequence":"first","affiliation":[{"name":"Department of IT Convergence, University of Ulsan, 93 Nam-gu, Ulsan, Republic of Korea"}]},{"given":"Yung-Keun","family":"Kwon","sequence":"additional","affiliation":[{"name":"Department of IT Convergence, University of Ulsan, 93 Nam-gu, Ulsan, Republic of Korea"}]}],"member":"286","published-online":{"date-parts":[[2018,9,8]]},"reference":[{"key":"2023061313523380700_bty584-B1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barabasi","year":"1999","journal-title":"Science"},{"key":"2023061313523380700_bty584-B2","doi-asserted-by":"crossref","first-page":"e0171097.","DOI":"10.1371\/journal.pone.0171097","article-title":"A novel mutual information-based Boolean network inference method from time-series gene expression data","volume":"12","author":"Barman","year":"2017","journal-title":"PLoS One"},{"key":"2023061313523380700_bty584-B3","first-page":"26","volume-title":"Pacific Symposium on Biocomputing","author":"Butte","year":"2000"},{"key":"2023061313523380700_bty584-B4","first-page":"40","volume-title":"Pacific Symposium on Biocomputing","author":"Chen","year":"1999"},{"key":"2023061313523380700_bty584-B5","doi-asserted-by":"crossref","first-page":"e8.","DOI":"10.1371\/journal.pbio.0050008","article-title":"Large-scale mapping and validation of Escherichia coli transcriptional regulation from a compendium of expression profiles","volume":"5","author":"Faith","year":"2007","journal-title":"PLoS Biol"},{"key":"2023061313523380700_bty584-B6","doi-asserted-by":"crossref","first-page":"S9","DOI":"10.1186\/1471-2164-13-S6-S9","article-title":"Boolean network inference from time series data incorporating prior biological knowledge","volume":"13","author":"Haider","year":"2012","journal-title":"BMC Genomics"},{"key":"2023061313523380700_bty584-B7","doi-asserted-by":"crossref","first-page":"e115806","DOI":"10.1371\/journal.pone.0115806","article-title":"A full bayesian approach for Boolean genetic network inference","volume":"9","author":"Han","year":"2014","journal-title":"PLoS One"},{"key":"2023061313523380700_bty584-B8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1186\/1752-0509-6-145","article-title":"Tigress: trustful inference of gene regulation using stability selection","volume":"6","author":"Haury","year":"2012","journal-title":"BMC Syst. Biol"},{"key":"2023061313523380700_bty584-B9","first-page":"175","volume-title":"Pacific Symposium on Biocomputing","author":"Imoto","year":"2002"},{"key":"2023061313523380700_bty584-B10","doi-asserted-by":"crossref","first-page":"e12776","DOI":"10.1371\/journal.pone.0012776","article-title":"Inferring regulatory networks from expression data using tree-based methods","volume":"5","author":"Irrthum","year":"2010","journal-title":"PLoS One"},{"key":"2023061313523380700_bty584-B11","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0022-5193(69)90015-0","article-title":"Metabolic stability and epigenesis in randomly constructed genetic nets","volume":"22","author":"Kauffman","year":"1969","journal-title":"J. Theor. Biol"},{"key":"2023061313523380700_bty584-B12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1023\/A:1023905711304","article-title":"On learning gene regulatory networks under the Boolean network model","volume":"52","author":"L\u00e4hdesm\u00e4ki","year":"2003","journal-title":"Mach. Learn"},{"key":"2023061313523380700_bty584-B13","doi-asserted-by":"crossref","first-page":"4781","DOI":"10.1073\/pnas.0305937101","article-title":"The yeast cell-cycle network is robustly designed","volume":"101","author":"Li","year":"2004","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023061313523380700_bty584-B14","first-page":"18","volume-title":"Pacific Symposium on Biocomputing","author":"Liang","year":"1998"},{"key":"2023061313523380700_bty584-B15","first-page":"281","volume-title":"Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability","author":"MacQueen","year":"1967"},{"key":"2023061313523380700_bty584-B16","doi-asserted-by":"crossref","first-page":"6286","DOI":"10.1073\/pnas.0913357107","article-title":"Revealing strengths and weaknesses of methods for gene network inference","volume":"107","author":"Marbach","year":"2010","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023061313523380700_bty584-B17","doi-asserted-by":"crossref","first-page":"S7.","DOI":"10.1186\/1471-2105-7-S1-S7","article-title":"Aracne: an algorithm for the reconstruction of gene regulatory networks in a mammalian cellular context","volume":"7","author":"Margolin","year":"2006","journal-title":"BMC Bioinformatics"},{"key":"2023061313523380700_bty584-B18","doi-asserted-by":"crossref","first-page":"e9202.","DOI":"10.1371\/journal.pone.0009202","article-title":"Towards a rigorous assessment of systems biology models: the dream3 challenges","volume":"5","author":"Prill","year":"2010","journal-title":"PLoS One"},{"key":"2023061313523380700_bty584-B19","doi-asserted-by":"crossref","first-page":"2263","DOI":"10.1093\/bioinformatics\/btr373","article-title":"Genenetweaver: in silico benchmark generation and performance profiling of network inference methods","volume":"27","author":"Schaffter","year":"2011","journal-title":"Bioinformatics"},{"key":"2023061313523380700_bty584-B20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1196\/annals.1407.021","article-title":"Dialogue on reverse-engineering assessment and methods","volume":"1115","author":"Stolovitzky","year":"2007","journal-title":"Ann. N.Y. Acad. Sci"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/34\/17\/i927\/50582701\/bioinformatics_34_17_i927.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/34\/17\/i927\/50582701\/bioinformatics_34_17_i927.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T13:55:40Z","timestamp":1686664540000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/34\/17\/i927\/5093222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,1]]},"references-count":20,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2018,9,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bty584","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"value":"1367-4803","type":"print"},{"value":"1367-4811","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,9,1]]},"published":{"date-parts":[[2018,9,1]]}}}