The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Modeling dependencies in protein-DNA binding sites
Abstract
The availability of whole genome sequences and high-throughput genomic assays opens the door for in silico analysis of transcription regulation. This includes methods for discovering and characterizing the binding sites of DNA-binding proteins, such as transcription factors. A common representation of transcription factor binding sites is a position specific score matrix (PSSM). This representation makes the strong assumption that binding site positions are independent of each other. In this work, we explore Bayesian network representations of binding sites that provide different tradeoffs between complexity (number of parameters) and the richness of dependencies between positions. We develop the formal machinery for learning such models from data and for estimating the statistical significance of putative binding sites. We then evaluate the ramifications of these richer representations in characterizing binding site motifs and predicting their genomic locations. We show that these richer representations improve over the PSSM model in both tasks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Gelman, A., Carlin, J. B., Stern, H. S., & Rubin, D. B. (2003) · doi:10.1201/9780429258480 · Cited by 27,276
Friedman, N., Geiger, D., & Goldszmidt, M. (1997) · Machine Learning · doi:10.1023/a:1007465528199 · Cited by 4,742
Self-citationTranscriptional 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
Cited by
Transcriptional control of human p53-regulated genes
Riley, T., Sontag, E., Chen, P., & Levine, A. (2008) · Nature Reviews Molecular Cell Biology · doi:10.1038/nrm2395 · Cited by 1,921
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
Absence 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
Harrison, M. M., Li, X.-Y., Kaplan, T., Botchan, M. R., & Eisen, M. B. (2011) · PLoS Genetics · doi:10.1371/journal.pgen.1002266 · Cited by 338
Self-citationMay, D., Itin, A., Gal, O., Kalinski, H., Feinstein, E., & Keshet, E. (2005) · Oncogene · doi:10.1038/sj.onc.1208325 · Cited by 167
Metadata
- Authors
- Barash, Y., Elidan, G., Friedman, N., & Kaplan, T.
- Venue
- Proceedings of the seventh annual international conference on Research in computational molecular biology
- Publisher
- ACM
- Published
- 2003-04-10
- Pages
- 28-37
- OpenAlex
- W2101025813
- Cited by
- 202
- References
- 3
- FWCI
- 43.33
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Modeling dependencies in protein-DNA binding sites. https://app.cochat.ai/papers/10.1145/640075.640079
- The paper
- Barash, Y., Elidan, G., Friedman, N., & Kaplan, T. (2003). Modeling dependencies in protein-DNA binding sites. Proceedings of the seventh annual international conference on Research in computational molecular biology. https://doi.org/10.1145/640075.640079
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.