The DOI matches its Crossref record; 81 of the 81 references it cites were found in a registry or an index.
A survey of DNA motif finding algorithms
Open accessAbstract
BACKGROUND: Unraveling the mechanisms that regulate gene expression is a major challenge in biology. An important task in this challenge is to identify regulatory elements, especially the binding sites in deoxyribonucleic acid (DNA) for transcription factors. These binding sites are short DNA segments that are called motifs. Recent advances in genome sequence availability and in high-throughput gene expression analysis technologies have allowed for the development of computational methods for motif finding. As a result, a large number of motif finding algorithms have been implemented and applied to various motif models over the past decade. This survey reviews the latest developments in DNA motif finding algorithms. RESULTS: Earlier algorithms use promoter sequences of coregulated genes from single genome and search for statistically overrepresented motifs. Recent algorithms are designed to use phylogenetic footprinting or orthologous sequences and also an integrated approach where promoter sequences of coregulated genes and phylogenetic footprinting are used. All the algorithms studied have been reported to correctly detect the motifs that have been previously detected by laboratory experimental approaches, and some algorithms were able to find novel motifs. However, most of these motif finding algorithms have been shown to work successfully in yeast and other lower organisms, but perform significantly worse in higher organisms. CONCLUSION: Despite considerable efforts to date, DNA motif finding remains a complex challenge for biologists and computer scientists. Researchers have taken many different approaches in developing motif discovery tools and the progress made in this area of research is very encouraging. Performance comparison of different motif finding tools and identification of the best tools have proven to be a difficult task because tools are designed based on algorithms and motif models that are diverse and complex and our incomplete understanding of the biology of regulatory mechanism does not always provide adequate evaluation of underlying algorithms over motif models.
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
Thompson, J. D., Higgins, D. G., & Gibson, T. J. (1994) · Nucleic Acids Research · doi:10.1093/nar/22.22.4673 · Cited by 64,617
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Sequence logos: a new way to display consensus sequences
Schneider, T. D., & Stephens, R. M. (1990) · Nucleic Acids Research · doi:10.1093/nar/18.20.6097 · Cited by 3,378
Monte Carlo Strategies in Scientific Computing
Liu, J. S. (2004) · Springer Series in Statistics · doi:10.1007/978-0-387-76371-2 · Cited by 2,690
Detecting Subtle Sequence Signals: a Gibbs Sampling Strategy for Multiple Alignment
Lawrence, C. E., Altschul, S. F., Boguski, M. S., Liu, J. S., Neuwald, A. F., & Wootton, J. C. (1993) · Science · doi:10.1126/science.8211139 · Cited by 1,807
Sequencing and comparison of yeast species to identify genes and regulatory elements
Kellis, M., Patterson, N., Endrizzi, M., Birren, B., & Lander, E. S. (2003) · Nature · doi:10.1038/nature01644 · Cited by 1,753
Karlin, S., & Altschul, S. F. (1990) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.87.6.2264 · Cited by 1,535
DNA binding sites: representation and discovery
Stormo, G. D. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.1.16 · Cited by 1,502
Monte Carlo Strategies in Scientific Computing
Hesterberg, T. (2002) · Technometrics · doi:10.1198/tech.2002.s85 · Cited by 1,409
Cited by
Epigenetic Transgenerational Actions of Vinclozolin on Promoter Regions of the Sperm Epigenome
Guerrero-Bosagna, C., Settles, M., Lucker, B., & Skinner, M. K. (2010) · PLoS ONE · doi:10.1371/journal.pone.0013100 · Cited by 427
Behnke, M. S., Wootton, J. C., Lehmann, M. M., Radke, J. B., Lucas, O., Nawas, J., Sibley, L. D., & White, M. W. (2010) · PLoS ONE · doi:10.1371/journal.pone.0012354 · Cited by 297
Interpretation of deep learning in genomics and epigenomics
Talukder, A., Barham, C., Li, X., & Hu, H. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbaa177 · Cited by 142
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
Guerrero-Bosagna, C., Weeks, S., & Skinner, M. K. (2014) · PLoS ONE · doi:10.1371/journal.pone.0100194 · Cited by 45
Metadata
- Authors
- Das, M. K., & Dai, H.-K.
- Venue
- BMC Bioinformatics
- Published
- 2007-11-01
- Volume
- 8
- Issue
- S7
- Pages
- S21-S21
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W2164814636
- Cited by
- 429
- References
- 81
- FWCI
- 10.18
- 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 survey of DNA motif finding algorithms. https://app.cochat.ai/papers/10.1186/1471-2105-8-s7-s21
- The paper
- Das, M. K., & Dai, H.-K. (2007). A survey of DNA motif finding algorithms. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-8-s7-s21
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.