BNFinder: exact and efficient method for learning Bayesian networks
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
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. 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). 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. Contact: dojer@mimuw.edu.pl
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Learning Bayesian networks is NP-complete
Chickering, D. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2404-4_12 · Cited by 1,001
A primer on learning in Bayesian networks for computational biology
Needham, C. J., Bradford, J. R., Bulpitt, A. J., & Westhead, D. R. (2007) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0030129 · Cited by 311 · cited 2×
“Despite differences in the interpretation of network structure, the methodology of these studies is remarkably similar [see, Needham et al. (2007) for overview and further examples].”
Method
Cited by
Bonn, S., Zinzen, R. P., Girardot, C., Gustafson, E. H., Perez-Gonzalez, A., Delhomme, N., Ghavi-Helm, Y., Wilczyński, B., Riddell, A., & Furlong, E. E. M. (2012) · Nature Genetics · doi:10.1038/ng.1064 · Cited by 502
Self-citationDefining an essential transcription factor program for naïve pluripotency
Dunn, S.-J., Martello, G., Yordanov, B., Emmott, S., & Smith, A. G. (2014) · Science · doi:10.1126/science.1248882 · Cited by 370
Yan, J., Risacher, S. L., Shen, L., & Saykin, A. J. (2017) · Briefings in Bioinformatics · doi:10.1093/bib/bbx066 · Cited by 325
Passing Messages between Biological Networks to Refine Predicted Interactions
Glass, K., Huttenhower, C., Quackenbush, J., & Yuan, G.-C. (2013) · PLoS ONE · doi:10.1371/journal.pone.0064832 · Cited by 266
“Reconstruction methods use various approaches including Bayesian network inference [7,8] and ordinary differential equations [9].”
Metadata
- Authors
- Wilczyński, B., & Dojer, N.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2008-09-30
- Volume
- 25
- Issue
- 2
- Pages
- 286-287
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2115428292
- Cited by
- 101
- References
- 2
- FWCI
- 5.30
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.