Probabilistic Inference of Transcription Factor Binding from Multiple Data Sources
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
An important problem in molecular biology is to build a complete understanding of transcriptional regulatory processes in the cell. We have developed a flexible, probabilistic framework to predict TF binding from multiple data sources that differs from the standard hypothesis testing (scanning) methods in several ways. Our probabilistic modeling framework estimates the probability of binding and, thus, naturally reflects our degree of belief in binding. Probabilistic modeling also allows for easy and systematic integration of our binding predictions into other probabilistic modeling methods, such as expression-based gene network inference. The method answers the question of whether the whole analyzed promoter has a binding site, but can also be extended to estimate the binding probability at each nucleotide position. Further, we introduce an extension to model combinatorial regulation by several TFs. Most importantly, the proposed methods can make principled probabilistic inference from multiple evidence sources, such as, multiple statistical models (motifs) of the TFs, evolutionary conservation, regulatory potential, CpG islands, nucleosome positioning, DNase hypersensitive sites, ChIP-chip binding segments and other (prior) sequence-based biological knowledge. We developed both a likelihood and a Bayesian method, where the latter is implemented with a Markov chain Monte Carlo algorithm. Results on a carefully constructed test set from the mouse genome demonstrate that principled data fusion can significantly improve the performance of TF binding prediction methods. We also applied the probabilistic modeling framework to all promoters in the mouse genome and the results indicate a sparse connectivity between transcriptional regulators and their target promoters. To facilitate analysis of other sequences and additional data, we have developed an on-line web tool, ProbTF, which implements our probabilistic TF binding prediction method using multiple data sources. Test data set, a web tool, source codes and supplementary data are available at: http://www.probtf.org.
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
Evolutionarily conserved elements in vertebrate, insect, worm, and yeast genomes
Siepel, A., Bejerano, G., Pedersen, J. S., Hinrichs, A. S., Hou, M., Rosenbloom, K., Clawson, H., Spieth, J., Hillier, L. W., Richards, S., et al. (2005) · Genome Research · doi:10.1101/gr.3715005 · Cited by 3,971 · cited 4×
“PhastCons uses genome alignments of 17 species and a continuous-time Markov model for nucleotide substitutions and a two state phylo-HMM model to compute posterior conservation probabilities.”
BackgroundMethodInfluentialTranscriptional Regulatory Networks in Saccharomyces cerevisiae
Lee, T. I., Rinaldi, N. J., Robert, F., Odom, D. T., Bar-Joseph, Z., Gerber, G. K., Hannett, N. M., Harbison, C. T., Thompson, C. M., Simon, I., et al. (2002) · Science · doi:10.1126/science.1075090 · Cited by 2,956
Xie, X., Lu, J., Kulbokas, E. J., Golub, T. R., Mootha, V., Lindblad-Toh, K., Lander, E. S., & Kellis, M. (2005) · Nature · doi:10.1038/nature03441 · Cited by 1,872 · cited 1×
“First, functional binding sites are typically evolutionarily conserved [71], albeit with the caveat described in the previous paragraph.”
BackgroundTranscription regulation and animal diversity
Levine, M., & Tjian, R. (2003) · Nature · doi:10.1038/nature01763 · Cited by 1,309 · cited 2×
“Binding sites are also commonly found to be organized into clusters (for a review, see [ 76 ]).”
BackgroundAssessing computational tools for the discovery of transcription factor binding sites
Tompa, M., Li, N., Bailey, T. L., Church, G. M., De Moor, B., Eskin, E., Favorov, A. V., Frith, M. C., Fu, Y., Kent, W. J., et al. (2005) · Nature Biotechnology · doi:10.1038/nbt1053 · Cited by 1,268 · cited 1×
“Several algorithms have been proposed for motif discovery (for a recent review and comparison, see [2,3]).”
MethodCawley, S., Bekiranov, S., Ng, H. H., Kapranov, P., Sekinger, E. A., Kampa, D., Piccolboni, A., Sementchenko, V., Cheng, J., Williams, A. J., et al. (2004) · Cell · doi:10.1016/s0092-8674(04)00127-8 · Cited by 1,095 · cited 1×
“52) is the well-known Sp1 protein (see [82]) that has been reported to bind practically everywhere in the human genome [83].”
BackgroundA systems approach to measuring the binding energy landscapes of transcription factors.
Maerkl, S. J., & Quake, S. R. (2007) · Science · doi:10.1126/science.1131007 · Cited by 584
Comprehensive curation and analysis of global interaction networks in Saccharomyces cerevisiae
Reguly, T., Breitkreutz, A., Boucher, L., Breitkreutz, B.-J., Hon, G. C., Myers, C. L., Parsons, A., Friesen, H., Oughtred, R., Tong, A., et al. (2006) · Journal of Biology · doi:10.1186/jbiol36 · Cited by 326
Cited by
Li, X.-Y., Thomas, S., Sabo, P. J., Eisen, M. B., Stamatoyannopoulos, J. A., & Biggin, M. D. (2011) · Genome Biology · doi:10.1186/gb-2011-12-4-r34 · Cited by 217
Genome-wide prediction of transcription factor binding sites using an integrated model
Won, K.-J., Ren, B., & Wang, W. (2010) · Genome Biology · doi:10.1186/gb-2010-11-1-r7 · Cited by 116
Vaparanta, K., Merilahti, J. A. M., Ojala, V. K., & Elenius, K. (2024) · Molecular & Cellular Proteomics · doi:10.1016/j.mcpro.2024.100780 · Cited by 3
“The cleavage site prediction method was modi fi ed from a previously published transcription factor – binding prediction method (41).”
Metadata
- Authors
- Lähdesmäki, H., Rust, A. G., & Shmulevich, I.
- Venue
- PLoS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2008-03-26
- Volume
- 3
- Issue
- 3
- Pages
- e1820
- ISSN
- 1932-6203 (ISSN-L)
- OpenAlex
- W2063566427
- Cited by
- 52
- References
- 8
- FWCI
- 3.10
- Type
- journal article
- Language
- en
- Open access
- gold
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.