The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Finding composite regulatory patterns in DNA sequences
Abstract
Pattern discovery in unaligned DNA sequences is a fundamental problem in computational biology with important applications in finding regulatory signals. Current approaches to pattern discovery focus on monad patterns that correspond to relatively short contiguous strings. However, many of the actual regulatory signals are composite patterns that are groups of monad patterns that occur near each other. A difficulty in discovering composite patterns is that one or both of the component monad patterns in the group may be ‘too weak’. Since the traditional monad-based motif finding algorithms usually output one (or a few) high scoring patterns, they often fail to find composite regulatory signals consisting of weak monad parts. In this paper, we present a MITRA (MIsmatch TRee Algorithm) approach for discovering composite signals. We demonstrate that MITRA performs well for both monad and composite patterns by presenting experiments over biological and synthetic data. Availability: MITRA is available at http://www.cs.columbia.edu/compbio/mitra/ Contact: eeskin@cs.columbia.edu Keywords: regulatory motif finding; pattern finding; dyad motifs.
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
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
Algorithms on strings, trees, and sequences
Gusfield, D. (1997) · Cited by 1,697
Hertz, G. Z., & Stormo, G. D. (1999) · Bioinformatics · doi:10.1093/bioinformatics/15.7.563 · Cited by 1,243
TRANSFAC: a database on transcription factors and their DNA binding sites
Wingender, E. (1996) · Nucleic Acids Research · doi:10.1093/nar/24.1.238 · Cited by 1,054
Hughes, J. D., Estep, P. W., Tavazoie, S., & Church, G. M. (2000) · Journal of Molecular Biology · doi:10.1006/jmbi.2000.3519 · Cited by 1,010
BIOPROSPECTOR: DISCOVERING CONSERVED DNA MOTIFS IN UPSTREAM REGULATORY REGIONS OF CO-EXPRESSED GENES
LIU, X., BRUTLAG, D. L., & LIU, J. S. (2000) · Biocomputing 2001 · doi:10.1142/9789814447362_0014 · Cited by 818
Unsupervised learning of multiple motifs in biopolymers using expectation maximization
Bailey, T. L., & Elkan, C. (1995) · Machine Learning · doi:10.1007/bf00993379 · Cited by 670
Computational Molecular Biology: An Algorithmic Approach
Pevzner, P. A. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/2022.001.0001 · Cited by 605
Self-citationCombinatorial approaches to finding subtle signals in DNA sequences.
Pevzner, P. A., & Sze, S. (2000) · PubMed · Cited by 549
Self-citationFinding Motifs Using Random Projections
Buhler, J., & Tompa, M. (2002) · Journal of Computational Biology · doi:10.1089/10665270252935430 · Cited by 532
Cited by
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
Self-citationA 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
Gibbs Recursive Sampler: finding transcription factor binding sites
Thompson, W. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg608 · Cited by 316
Combining phylogenetic data with co-regulated genes to identify regulatory motifs
Wang, T., & Stormo, G. D. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg329 · Cited by 272
Metadata
- Authors
- Eskin, E., & Pevzner, P. A.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-07-01
- Volume
- 18
- Issue
- suppl_1
- Pages
- S354-S363
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2128091972
- Cited by
- 328
- References
- 25
- FWCI
- 5.29
- Type
- journal article
- 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: Finding composite regulatory patterns in DNA sequences. https://app.cochat.ai/papers/10.1093/bioinformatics/18.suppl_1.s354
- The paper
- Eskin, E., & Pevzner, P. A. (2002). Finding composite regulatory patterns in DNA sequences. Bioinformatics. https://doi.org/10.1093/bioinformatics/18.suppl_1.s354
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.