{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T12:23:59Z","timestamp":1767961439512,"version":"3.49.0"},"reference-count":15,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2016,10,2]],"date-time":"2016-10-02T00:00:00Z","timestamp":1475366400000},"content-version":"vor","delay-in-days":2924,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.0\/uk\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,1,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: Bayesian methods are widely used in many different areas of research. Recently, it has become a very popular tool for biological network reconstruction, due to its ability to handle noisy data. Even though there are many software packages allowing for Bayesian network reconstruction, only few of them are freely available to researchers. Moreover, they usually require at least basic programming abilities, which restricts their potential user base. Our goal was to provide software which would be freely available, efficient and usable to non-programmers.<\/jats:p>\n               <jats:p>Results: We present a BNFinder software, which allows for Bayesian network reconstruction from experimental data. It supports dynamic Bayesian networks and, if the variables are partially ordered, also static Bayesian networks. The main advantage of BNFinder is the use exact algorithm, which is at the same time very efficient (polynomial with respect to the number of observations).<\/jats:p>\n               <jats:p>Availability: The software, supplementary information and manual is available at http:\/\/bioputer.mimuw.edu.pl\/software\/bnf\/. Besides the availability of the standalone application and the source code, we have developed a web interface to BNFinder application running on our servers. A web tutorial on different options of BNFinder is also available.<\/jats:p>\n               <jats:p>Contact: \u00a0dojer@mimuw.edu.pl<\/jats:p>","DOI":"10.1093\/bioinformatics\/btn505","type":"journal-article","created":{"date-parts":[[2008,10,1]],"date-time":"2008-10-01T02:32:45Z","timestamp":1222828365000},"page":"286-287","source":"Crossref","is-referenced-by-count":79,"title":["BNFinder: exact and efficient method for learning Bayesian networks"],"prefix":"10.1093","volume":"25","author":[{"given":"Bartek","family":"Wilczy\u0144ski","sequence":"first","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Poland"}]},{"given":"Norbert","family":"Dojer","sequence":"additional","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Poland"}]}],"member":"286","published-online":{"date-parts":[[2008,9,30]]},"reference":[{"key":"2023013110002298000_B1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0092-8674(04)00304-6","article-title":"Predicting gene expression from sequence.","volume":"117","author":"Beer","year":"2004","journal-title":"Cell"},{"key":"2023013110002298000_B2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-2404-4_12","article-title":"Learning Bayesian networks is NP-complete.","volume-title":"Learning from Data: Artificial Inteligence and Statistics V.","author":"Chickering","year":"1996"},{"key":"2023013110002298000_B3","first-page":"1287","article-title":"Large-sample learning of Bayesian networks is NP-hard.","volume":"5","author":"Chickering","year":"2004","journal-title":"J. Mach. Learn. Res"},{"key":"2023013110002298000_B4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/11821069_27","article-title":"Learning Bayesian networks does not have to be NP-hard","volume-title":"Proceedings of Mathematical Foundations of Computer Science 2006.","author":"Dojer","year":"2006"},{"key":"2023013110002298000_B5","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1186\/1471-2105-7-249","article-title":"Applying dynamic Bayesian networks to perturbed gene expression data.","volume":"7","author":"Dojer","year":"2006","journal-title":"BMC Bioinformatics"},{"key":"2023013110002298000_B6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1020249912095","article-title":"Being Bayesian about network structure. a bayesian approach to structure discovery in bayesian networks.","volume":"50","author":"Friedman","year":"2003","journal-title":"Mach. Learn"},{"key":"2023013110002298000_B7","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1093\/bioinformatics\/btg313","article-title":"Sensitivity and specificity of inferring genetic regulatory interactions from microarray experiments with dynamic Bayesian networks.","volume":"19","author":"Husmeier","year":"2003","journal-title":"Bioinformatics"},{"key":"2023013110002298000_B8","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1613\/jair.914","article-title":"Finding a path is harder than finding a tree.","volume":"15","author":"Meek","year":"2001","journal-title":"J. Artif. Intell. Res."},{"key":"2023013110002298000_B9","article-title":"Software packages for graphical models \u2013 Bayesian networks.","volume":"14","author":"Murphy","year":"2007","journal-title":"Bull. Int. Soc. Bayesian Anal"},{"key":"2023013110002298000_B10","article-title":"Bayes Net Toolbox","volume-title":"Technical report.","author":"Murphy","year":"2002"},{"key":"2023013110002298000_B11","first-page":"e129","article-title":"A primer on learning in Bayesian networks for computational biology.","volume-title":"PLoS Comput. Biol.","author":"Needham","year":"2007"},{"key":"2023013110002298000_B12","first-page":"557","article-title":"Finding optimal models for small gene networks.","volume-title":"Pac. Symp. Biocomput.","author":"Ott","year":"2004"},{"key":"2023013110002298000_B13","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1093\/bioinformatics\/btg1038","article-title":"Genome-wide discovery of transcriptional modules from DNA sequence and gene expression.","volume":"19","author":"Segal","year":"2003","journal-title":"Bioinformatics"},{"key":"2023013110002298000_B14","doi-asserted-by":"crossref","first-page":"e161","DOI":"10.1371\/journal.pcbi.0020161","article-title":"Computational inference of neural information flow networks.","volume":"2","author":"Smith","year":"2006","journal-title":"PLoS Comput. Biol"},{"key":"2023013110002298000_B15","doi-asserted-by":"crossref","first-page":"ii227","DOI":"10.1093\/bioinformatics\/btg1082","article-title":"Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection.","volume":"1","author":"Tamada","year":"2003","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/25\/2\/286\/48982779\/bioinformatics_25_2_286.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/25\/2\/286\/48982779\/bioinformatics_25_2_286.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T18:41:01Z","timestamp":1675190461000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/25\/2\/286\/218091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,30]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,1,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btn505","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2009,1,15]]},"published":{"date-parts":[[2008,9,30]]}}}