{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T17:50:43Z","timestamp":1722275443857},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T00:00:00Z","timestamp":1405382400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Bioinform Sys Biology"],"published-print":{"date-parts":[[2014,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Restricted Boolean networks are simplified Boolean networks that are required for either negative or positive regulations between genes. Higa et al. (BMC Proc 5:S5, 2011) proposed a three-rule algorithm to infer a restricted Boolean network from time-series data. However, the algorithm suffers from a major drawback, namely, it is very sensitive to noise. In this paper, we systematically analyze the regulatory relationships between genes based on the state switch of the target gene and propose an algorithm with which restricted Boolean networks may be inferred from time-series data. We compare the proposed algorithm with the three-rule algorithm and the best-fit algorithm based on both synthetic networks and a well-studied budding yeast cell cycle network. The performance of the algorithms is evaluated by three distance metrics: the normalized-edge Hamming distance <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                <mml:msubsup>\n                  <mml:mi>\u03bc<\/mml:mi>\n                  <mml:mi>ham<\/mml:mi>\n                  <mml:mi>e<\/mml:mi>\n                <\/mml:msubsup>\n              <\/mml:math>\n            <\/jats:inline-formula>, the normalized Hamming distance of state transition <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                <mml:msubsup>\n                  <mml:mi>\u03bc<\/mml:mi>\n                  <mml:mi>ham<\/mml:mi>\n                  <mml:mi>st<\/mml:mi>\n                <\/mml:msubsup>\n              <\/mml:math>\n            <\/jats:inline-formula>, and the steady-state distribution distance <jats:italic>\u03bc<\/jats:italic>\n            <jats:sup>ssd<\/jats:sup>. Results show that the proposed algorithm outperforms the others according to both <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                <mml:msubsup>\n                  <mml:mi>\u03bc<\/mml:mi>\n                  <mml:mi>ham<\/mml:mi>\n                  <mml:mi>e<\/mml:mi>\n                <\/mml:msubsup>\n              <\/mml:math>\n            <\/jats:inline-formula> and <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                <mml:msubsup>\n                  <mml:mi>\u03bc<\/mml:mi>\n                  <mml:mi>ham<\/mml:mi>\n                  <mml:mi>st<\/mml:mi>\n                <\/mml:msubsup>\n              <\/mml:math>\n            <\/jats:inline-formula>, whereas its performance according to <jats:italic>\u03bc<\/jats:italic>\n            <jats:sup>ssd<\/jats:sup> is intermediate between best-fit and the three-rule algorithms. Thus, our new algorithm is more appropriate for inferring interactions between genes from time-series data.<\/jats:p>","DOI":"10.1186\/s13637-014-0010-5","type":"journal-article","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T15:05:07Z","timestamp":1405350307000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Learning restricted Boolean network model by time-series data"],"prefix":"10.1186","volume":"2014","author":[{"given":"Hongjia","family":"Ouyang","sequence":"first","affiliation":[]},{"given":"Jie","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Liangzhong","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Edward R","family":"Dougherty","sequence":"additional","affiliation":[]},{"given":"Wenbin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,15]]},"reference":[{"key":"10_CR1","volume-title":"Genomic Signal Processing (Princeton Series in Applied Mathematics)","author":"S Ilya","year":"2007","unstructured":"Ilya S, Dougherty ER: Genomic Signal Processing (Princeton Series in Applied Mathematics). Princeton University Press, Princeton; 2007."},{"key":"10_CR2","volume-title":"Probabilistic Boolean Networks: The Modeling and Control of Gene Regulatory Networks","author":"S Ilya","year":"2010","unstructured":"Ilya S, Dougherty ER: Probabilistic Boolean Networks: The Modeling and Control of Gene Regulatory Networks. Siam, Philadelphia; 2010."},{"key":"10_CR3","volume-title":"REVEAL, a general reverse engineering algorithm for inference of genetic network architectures, in Pacific Symposium on Biocomputing","author":"L Shoudan","year":"1998","unstructured":"Shoudan L, Stefanie F, Roland S: REVEAL, a general reverse engineering algorithm for inference of genetic network architectures, in Pacific Symposium on Biocomputing. World Scientific, Hawaii; 1998."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"S7","DOI":"10.1186\/1471-2105-7-S1-S7","volume":"7","author":"AA Margolin","year":"2006","unstructured":"Margolin AA, Ilya N, Katia B, Chris W, Gustavo S, Riccardo DF, Andrea C: ARACNE: an algorithm for the reconstruction of gene regulatory networks in a mammalian cellular context. BMC Bioinforma 2006, 7: S7.","journal-title":"BMC Bioinforma"},{"key":"10_CR5","volume-title":"EURASIP J. Bioinforma. Syst. Biol","author":"W Zhao","year":"2008","unstructured":"Zhao W, Serpedin E, Dougherty ER: Recovering genetic regulatory networks from chromatin immunoprecipitation and steady-state microarray data. EURASIP J. Bioinforma. Syst. Biol. 2008."},{"key":"10_CR6","first-page":"S7","volume":"4","author":"C Vijender","year":"2010","unstructured":"Vijender C, Preetam G, Edward P, Gong GP, Deng Y, Zhang C: A novel gene network inference algorithm using predictive minimum description length approach. BMC Syst. Biol. 2010, 4: S7.","journal-title":"BMC Syst. Biol"},{"key":"10_CR7","first-page":"487","volume-title":"International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing (IJCBS)","author":"C Vijender","year":"2009","unstructured":"Vijender C, Chaoyang Z, Preetam G, Perkins EJ, Gong P, Deng Y: Gene regulatory network inference using predictive minimum description length principle and conditional mutual information. In International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing (IJCBS). Edited by: Zhang J, Li G, Yang JY. IEEE Computer Society, Piscataway; 2009:487-490."},{"key":"10_CR8","first-page":"1","volume-title":"IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS)","author":"J Dougherty","year":"2007","unstructured":"Dougherty J, Tabus I, Astola J: A universal minimum description length-based algorithm for inferring the structure of genetic networks. In IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS). Edited by: Huang Y. IEEE, Piscataway; 2007:1-2."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1155\/S1110865701000270","volume":"2001","author":"I Tabus","year":"2001","unstructured":"Tabus I, Astola J: On the use of MDL principle in gene expression prediction. EURASIP J Appl Signal Process 2001, 2001: 297-303.","journal-title":"EURASIP J Appl Signal Process"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"2129","DOI":"10.1093\/bioinformatics\/btl364","volume":"22","author":"W Zhao","year":"2006","unstructured":"Zhao W, Erchin S, Dougherty ER: Inferring gene regulatory networks from time series data using the minimum description length principle. Bioinformatics 2006, 22: 2129-2135.","journal-title":"Bioinformatics"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"2219","DOI":"10.1016\/S0165-1684(00)00079-7","volume":"80","author":"RE Dougherty","year":"2000","unstructured":"Dougherty RE, Seungchan K, Yidong C: Coefficient of determination in nonlinear signal processing. Signal Process. 2000, 80: 2219-2235.","journal-title":"Signal Process"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1117\/1.1289142","volume":"5","author":"S Kim","year":"2000","unstructured":"Kim S, Dougherty ER, Bittner ML, Chen Y, Sivakumar K, Meltzer P, Trent JM: General nonlinear framework for the analysis of gene interaction via multivariate expression arrays. J. Biomed. Opt. 2000, 5: 411-424.","journal-title":"J. Biomed. Opt"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1093\/bioinformatics\/18.2.261","volume":"18","author":"I Shmulevich","year":"2002","unstructured":"Shmulevich I, Dougherty ER, Seungchan K, Zhang W: Probabilistic Boolean networks: a rule-based uncertainty model for gene regulatory networks. Bioinformatics 2002, 18: 261-274.","journal-title":"Bioinformatics"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1023905711304","volume":"52","author":"H L\u00e4hdesm\u00e4ki","year":"2003","unstructured":"L\u00e4hdesm\u00e4ki H, Shmulevich I, Yli-Harja O: Learning gene regulatory networks under the Boolean network model. Mach. Learn. 2003, 52: 147-167.","journal-title":"Mach. Learn"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"13439","DOI":"10.1073\/pnas.0506771102","volume":"102","author":"I Shmulevich","year":"2005","unstructured":"Shmulevich I, Kauffman SA, Maximino A: Eukaryotic cells are dynamically ordered or critical but not chaotic. Proc. Natl. Acad. Sci. U. S. A. 2005, 102: 13439-13444.","journal-title":"Proc. Natl. Acad. Sci. U. S. A"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1073\/pnas.0711525105","volume":"105","author":"M Nykter","year":"2008","unstructured":"Nykter M, Price ND, Maximino A, et al.: Gene expression dynamics in the macrophage exhibit criticality. Proc. Natl. Acad. Sci. 2008, 105: 1897-1900.","journal-title":"Proc. Natl. Acad. Sci"},{"key":"10_CR17","author":"W Liu","year":"2008","unstructured":"W Liu, H L\u00e4hdesm\u00e4ki, ER Dougherty, I Shmulevich, Inference of Boolean networks using sensitivity regularization. EURASIP J. Bioinforma. Syst. Biol. (2008). doi:10.1155\/2008\/780541","journal-title":"EURASIP J. Bioinforma. Syst. Biol."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"4781","DOI":"10.1073\/pnas.0305937101","volume":"101","author":"F Li","year":"2004","unstructured":"Li F, Long T, Ying L, Ouyang Q, Tang C: The yeast cell-cycle network is robustly designed. Proc. Natl. Acad. Sci. U. S. A. 2004, 101: 4781-4786.","journal-title":"Proc. Natl. Acad. Sci. U. S. A"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.physd.2006.05.009","volume":"219","author":"Y Zhang","year":"2006","unstructured":"Zhang Y, Qian M, Ouyang Q, Deng M, Li F, Tang C: Stochastic model of yeast cell-cycle network. Physica D: Nonlinear Phenomena 2006, 219: 35-39.","journal-title":"Physica D: Nonlinear Phenomena"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"051907","DOI":"10.1103\/PhysRevE.75.051907","volume":"75","author":"L Kai-Yeung","year":"2007","unstructured":"Kai-Yeung L, Surya G, Chao T: Function constrains network architecture and dynamics: a case study on the yeast cell cycle Boolean network. Phys. Rev. E. 2007, 75: 051907.","journal-title":"Phys. Rev. E"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"S85","DOI":"10.1098\/rsif.2008.0132.focus","volume":"5","author":"S Bornholdt","year":"2008","unstructured":"Bornholdt S: Boolean network models of cellular regulation: prospects and limitations. J. R. Soc. Interface 2008, 5: S85-S94.","journal-title":"J. R. Soc. Interface"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"e1672","DOI":"10.1371\/journal.pone.0001672","volume":"3","author":"MI Davidich","year":"2008","unstructured":"Davidich MI, Stefan B: Boolean network model predicts cell cycle sequence of fission yeast. PLoS One 2008, 3: e1672.","journal-title":"PLoS One"},{"key":"10_CR23","first-page":"1","volume-title":"IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS)","author":"H Ronaldo Fumio","year":"2009","unstructured":"Ronaldo Fumio H, Henrique S, Carlos HA H: Budding yeast cell cycle modeled by context-sensitive probabilistic Boolean network. In IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS). Edited by: Braga-Neto U. IEEE, Piscataway; 2009:1-4."},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"e45780","DOI":"10.1371\/journal.pone.0045780","volume":"7","author":"RG Todd","year":"2012","unstructured":"Todd RG, Tom\u00e1\u0161 H: Ergodic sets as cell phenotype of budding yeast cell cycle. PLoS One 2012, 7: e45780.","journal-title":"PLoS One"},{"issue":"Suppl 2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"S5","DOI":"10.1186\/1753-6561-5-S2-S5","volume":"5","author":"CHA Higa","year":"2011","unstructured":"Higa CHA, Louzada VHP, Andrade TP, Hashimoto RF: Constraint-based analysis of gene interactions using restricted Boolean networks and time-series data. BMC Proc. 2011,5(Suppl 2):S5.","journal-title":"BMC Proc"},{"key":"10_CR26","first-page":"502","volume-title":"Theory and Applications of Satisfiability Testing","author":"E Niklas","year":"2004","unstructured":"Niklas E, Niklas S: An extensible SAT-solver. In Theory and Applications of Satisfiability Testing. Edited by: Giunchiglia E, Tacchella A. Springer, New York; 2004:502-518."},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1093\/bib\/bbq078","volume":"12","author":"ER Dougherty","year":"2011","unstructured":"Dougherty ER: Validation of gene regulatory networks: scientific and inferential. Brief. Bioinform. 2011, 12: 245-252.","journal-title":"Brief. Bioinform"},{"key":"10_CR28","first-page":"272","volume":"4","author":"Q Xiaoning","year":"2013","unstructured":"Xiaoning Q, Dougherty ER: Validation of gene regulatory network inference based on controllability. Front. Genet. 2013, 4: 272.","journal-title":"Front. Genet"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1093\/bioinformatics\/btq225","volume":"26","author":"N Ghaffari","year":"2010","unstructured":"Ghaffari N, Ivanov I, Qian X, Dougherty ER: A CoD-based reduction algorithm for designing stationary control policies on Boolean networks. Bioinformatics 2010, 26: 1556-1563.","journal-title":"Bioinformatics"},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"4871","DOI":"10.1109\/TSP.2010.2050314","volume":"58","author":"I Ivanov","year":"2010","unstructured":"Ivanov I, Simeonov P, Ghaffari N, Xiaoning Q, Dougherty ER: Selection policy-induced reduction mappings for Boolean networks. Signal Process. IEEE Trans. 2010, 58: 4871-4882.","journal-title":"Signal Process. IEEE Trans"},{"key":"10_CR31","doi-asserted-by":"publisher","first-page":"3098","DOI":"10.1093\/bioinformatics\/btq575","volume":"26","author":"X Qian","year":"2010","unstructured":"Qian X, Ghaffari N, Ivanov I, Dougherty ER: State reduction for network intervention in probabilistic Boolean networks. Bioinformatics 2010, 26: 3098-3104.","journal-title":"Bioinformatics"},{"key":"10_CR32","doi-asserted-by":"publisher","first-page":"4021","DOI":"10.1093\/bioinformatics\/bti664","volume":"21","author":"R Pal","year":"2005","unstructured":"Pal R, Ivanov I, Datta A, Bittner ML, Dougherty ER: Generating Boolean networks with a prescribed attractor structure. Bioinformatics 2005, 21: 4021-4025.","journal-title":"Bioinformatics"}],"container-title":["EURASIP Journal on Bioinformatics and Systems Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13637-014-0010-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13637-014-0010-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13637-014-0010-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13637-014-0010-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,2]],"date-time":"2021-09-02T04:52:42Z","timestamp":1630558362000},"score":1,"resource":{"primary":{"URL":"https:\/\/bsb-eurasipjournals.springeropen.com\/articles\/10.1186\/s13637-014-0010-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,15]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["10"],"URL":"https:\/\/doi.org\/10.1186\/s13637-014-0010-5","relation":{},"ISSN":["1687-4153"],"issn-type":[{"value":"1687-4153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,15]]},"assertion":[{"value":"15 December 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2014","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"10"}}