A novel ensemble learning method for de novo computational identification of DNA binding sites
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Background: Despite the diversity of motif representations and search algorithms, the de novo computational identification of transcription factor binding sites remains constrained by the limited accuracy of existing algorithms and the need for user-specified input parameters that describe the motif being sought. Results: We present a novel ensemble learning method, SCOPE, that is based on the assumption that transcription factor binding sites belong to one of three broad classes of motifs: non-degenerate, degenerate and gapped motifs. SCOPE employs a unified scoring metric to combine the results from three motif finding algorithms each aimed at the discovery of one of these classes of motifs. We found that SCOPE's performance on 78 experimentally characterized regulons from four species was a substantial and statistically significant improvement over that of its component algorithms. SCOPE outperformed a broad range of existing motif discovery algorithms on the same dataset by a statistically significant margin. Conclusion: SCOPE demonstrates that combining multiple, focused motif discovery algorithms can provide a significant gain in performance. By building on components that efficiently search for motifs without user-defined parameters, SCOPE requires as input only a set of upstream sequences and a species designation, making it a practical choice for non-expert users. A user-friendly web interface, Java source code and executables are available at http://genie.dartmouth.edu/scope.
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
Assessing 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 8×
“…the parameters of the programs in question [4,6,7] or allow expert users to tune their own programs and manually filter both the input and output [5] we intentionally made our comparisons between programs without manually optimizing any parameters for any species so as to emulate typical use…”
BackgroundResultInfluentialClustering of DNA Sequences in Human Promoters
FitzGerald, P. C., Shlyakhtenko, A., Mir, A. A., & Vinson, C. (2004) · Genome Research · doi:10.1101/gr.1953904 · Cited by 242
Cited by
Mapping the Core of the Arabidopsis Circadian Clock Defines the Network Structure of the Oscillator
Huang, W., Pérez-García, P., Pokhilko, A., Millar, A. J., Antoshechkin, I., Riechmann, J. L., & Mas, P. (2012) · Science · doi:10.1126/science.1219075 · Cited by 501
Znaidi, S., Weber, S., Zin Al-Abdin, O., Bomme, P., Saidane, S., Drouin, S., Lemieux, S., De Deken, X., Robert, F., & Raymond, M. (2008) · Eukaryotic Cell · doi:10.1128/ec.00070-08 · Cited by 119
“quences by using three different motif discovery algorithms (7, 9).”
MethodIdentification of the Candida albicans Cap1p Regulon
Znaidi, S., Barker, K. S., Weber, S., Alarco, A.-M., Liu, T. T., Boucher, G., Rogers, P. D., & Raymond, M. (2009) · Eukaryotic Cell · doi:10.1128/ec.00002-09 · Cited by 115
“set of sequences using three different motif discovery algorithms (10, 12).”
MethodDalal, C. K., Zuleta, I. A., Mitchell, K. F., Andes, D. R., El-Samad, H., & Johnson, A. D. (2016) · eLife · doi:10.7554/elife.18981 · Cited by 62
“Due in part to this high induction ratio (>350 fold), Gal4 has been adapted as a tool to artificially turn genes on and off in many animal and plant species (Brand and Perrimon, 1993; Fischer et al., 1988; Hartley et al., 2002; Kakidani and Ptashne, 1988; Waki et al., 2013; Webster et al., 1988).”
BackgroundQi, Z., Smith, K. M., Bredeweg, E. L., Bosnjak, N., Freitag, M., & Nargang, F. E. (2017) · G3 Genes|Genomes|Genetics · doi:10.1534/g3.116.035402 · Cited by 12
“Thus, we examined the intergenic upstream regions of the 65 peak sets (98 genes) in Table 3 for the presence of this sequence, using the SCOPE search tool (Chakravarty et al. 2007).”
Method
Metadata
- Authors
- Chakravarty, A., Carlson, J. M., Khetani, R. S., & Gross, R. H.
- Venue
- BMC Bioinformatics
- Published
- 2007-07-12
- Volume
- 8
- Issue
- 1
- Pages
- 249-249
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W1996149236
- Cited by
- 54
- References
- 2
- FWCI
- 1.44
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A novel ensemble learning method for de novo computational identification of DNA binding sites. https://app.cochat.ai/papers/10.1186/1471-2105-8-249
- The paper
- Chakravarty, A., Carlson, J. M., Khetani, R. S., & Gross, R. H. (2007). A novel ensemble learning method for de novo computational identification of DNA binding sites. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-8-249
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.