The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Limitations and potentials of current motif discovery algorithms
Open accessAbstract
Computational methods for de novo identification of gene regulation elements, such as transcription factor binding sites, have proved to be useful for deciphering genetic regulatory networks. However, despite the availability of a large number of algorithms, their strengths and weaknesses are not sufficiently understood. Here, we designed a comprehensive set of performance measures and benchmarked five modern sequence-based motif discovery algorithms using large datasets generated from Escherichia coli RegulonDB. Factors that affect the prediction accuracy, scalability and reliability are characterized. It is revealed that the nucleotide and the binding site level accuracy are very low, while the motif level accuracy is relatively high, which indicates that the algorithms can usually capture at least one correct motif in an input sequence. To exploit diverse predictions from multiple runs of one or more algorithms, a consensus ensemble algorithm has been developed, which achieved 6-45% improvement over the base algorithms by increasing both the sensitivity and specificity. Our study illustrates limitations and potentials of existing sequence-based motif discovery algorithms. Taking advantage of the revealed potentials, several promising directions for further improvements are discussed. Since the sequence-based algorithms are the baseline of most of the modern motif discovery algorithms, this paper suggests substantial improvements would be possible for them.
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
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
Parameter estimation in biochemical pathways: a comparison of global optimization methods
Moles, C. G., Mendes, P., & Banga, J. R. (2003) · Genome Research · doi:10.1101/gr.1262503 · Cited by 858
Cited by
MEME: discovering and analyzing DNA and protein sequence motifs
Bailey, T. L., Williams, N., Misleh, C., & Li, W. W. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkl198 · Cited by 2,670
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
A survey of DNA motif finding algorithms
Das, M. K., & Dai, H.-K. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-s7-s21 · Cited by 429
Cis and trans determinants of epigenetic silencing by Polycomb repressive complex 2 in Arabidopsis
Xiao, J., Jin, R., Yu, X., Shen, M., Wagner, J. D., Pai, A., Song, C., Zhuang, M., Klasfeld, S., He, C., et al. (2017) · Nature Genetics · doi:10.1038/ng.3937 · Cited by 284
An improved map of conserved regulatory sites for Saccharomyces cerevisiae
MacIsaac, K. D., Wang, T., Gordon, D. B., Gifford, D. K., Stormo, G. D., & Fraenkel, E. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-113 · Cited by 9
Metadata
- Authors
- Hu, J., Li, B., & Kihara, D.
- Venue
- Nucleic Acids Research
- Publisher
- Oxford University Press (OUP)
- Published
- 2005-09-02
- Volume
- 33
- Issue
- 15
- Pages
- 4899-4913
- ISSN
- 0305-1048 (ISSN-L)
- 1362-4962
- OpenAlex
- W2115979107
- Cited by
- 238
- References
- 2
- FWCI
- 7.61
- 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: Limitations and potentials of current motif discovery algorithms. https://app.cochat.ai/papers/10.1093/nar/gki791
- The paper
- Hu, J., Li, B., & Kihara, D. (2005). Limitations and potentials of current motif discovery algorithms. Nucleic Acids Research. https://doi.org/10.1093/nar/gki791
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.