The DOI matches its Crossref record.
Identification of transcription factor binding sites with variable-order Bayesian networks
Abstract
MOTIVATION: We propose a new class of variable-order Bayesian network (VOBN) models for the identification of transcription factor binding sites (TFBSs). The proposed models generalize the widely used position weight matrix (PWM) models, Markov models and Bayesian network models. In contrast to these models, where for each position a fixed subset of the remaining positions is used to model dependencies, in VOBN models, these subsets may vary based on the specific nucleotides observed, which are called the context. This flexibility turns out to be of advantage for the classification and analysis of TFBSs, as statistical dependencies between nucleotides in different TFBS positions (not necessarily adjacent) may be taken into account efficiently--in a position-specific and context-specific manner. RESULTS: We apply the VOBN model to a set of 238 experimentally verified sigma-70 binding sites in Escherichia coli. We find that the VOBN model can distinguish these 238 sites from a set of 472 intergenic 'non-promoter' sequences with a higher accuracy than fixed-order Markov models or Bayesian trees. We use a replicated stratified-holdout experiment having a fixed true-negative rate of 99.9%. We find that for a foreground inhomogeneous VOBN model of order 1 and a background homogeneous variable-order Markov (VOM) model of order 5, the obtained mean true-positive (TP) rate is 47.56%. In comparison, the best TP rate for the conventional models is 44.39%, obtained from a foreground PWM model and a background 2nd-order Markov model. As the standard deviation of the estimated TP rate is approximately 0.01%, this improvement is highly significant.
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
Cited by
Discovering motifs in ranked lists of DNA sequences
Eden, E., Lipson, D., Yogev, S., & Yakhini, Z. (2007) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0030039 · Cited by 696
“Alternatively, higher order representations that capture positional dependencies have been proposed (e.g., HMM and Bayesian networks motif representations [13]).”
BackgroundAbsence of a simple code: how transcription factors read the genome
Slattery, M., Zhou, T., Yang, L., Dantas Machado, A. C., Gordân, R., & Rohs, R. (2014) · Trends in Biochemical Sciences · doi:10.1016/j.tibs.2014.07.002 · Cited by 537
Identification of transcription factor binding sites using ATAC-seq
Li, Z., Schulz, M. H., Look, T., Begemann, M., Zenke, M., & Costa, I. G. (2019) · Genome Biology · doi:10.1186/s13059-019-1642-2 · Cited by 452
Wingender, E. (2008) · Briefings in Bioinformatics · doi:10.1093/bib/bbn016 · Cited by 435
Ben‐Gal, I. (2007) · Encyclopedia of Statistics in Quality and Reliability · doi:10.1002/9780470061572.eqr089 · Cited by 325
Self-citationPessach, D., Singer, G., Avrahami, D., Chalutz Ben-Gal, H., Shmueli, E., & Ben-Gal, I. (2020) · Decision Support Systems · doi:10.1016/j.dss.2020.113290 · Cited by 304
Self-citationSpecificity and nonspecificity in RNA–protein interactions
Jankowsky, E., & Harris, M. E. (2015) · Nature Reviews Molecular Cell Biology · doi:10.1038/nrm4032 · Cited by 283
Protein-DNA binding: complexities and multi-protein codes
Siggers, T., & Gordân, R. (2014) · Nucleic Acids Research · doi:10.1093/nar/gkt1112 · Cited by 229
Xia, X. (2012) · Scientifica · doi:10.6064/2012/917540 · Cited by 73
Navigating the non-coding genome in heart development and Congenital Heart Disease
Chahal, G., Tyagi, S., & Ramialison, M. (2019) · Differentiation · doi:10.1016/j.diff.2019.05.001 · Cited by 31
Metadata
- Authors
- Ben-Gal, I., Shani, A., Gohr, A., Grau, J., Arviv, S., Shmilovici, A., Posch, S., & Grosse, I.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2005-03-29
- Volume
- 21
- Issue
- 11
- Pages
- 2657-2666
- ISSN
- 0266-7061 (ISSN-L)
- 1367-4803
- 1460-2059
- OpenAlex
- W2151945801
- Cited by
- 170
- References
- 0
- FWCI
- 4.15
- Type
- journal article
- Language
- en
- Open access
- closed
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.