The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
An algorithm for finding signals of unknown length in DNA sequences
Open accessAbstract
Pattern discovery in unaligned DNA sequences is a challenging problem in both computer science and molecular biology. Several different methods and techniques have been proposed so far, but in most of the cases signals in DNA sequences are very complicated and avoid detection. Exact exhaustive methods can solve the problem only for short signals with a limited number of mutations. In this work, we extend exhaustive enumeration also to longer patterns. More in detail, the basic version of algorithm presented in this paper, given as input a set of sequences and an error ratio ε < 1, finds all patterns that occur in at least q sequences of the set with at most εm mutations, where m is the length of the pattern. The only restriction is imposed on the location of mutations along the signal. That is, a valid occurrence of a pattern can present at most ⌈εi⌉ mismatches in the first i nucleotides, and so on. However, we show how the algorithm can be used also when no assumption can be made on the position of mutations. In this case, it is also possible to have an estimate of the probability of finding a signal according to the signal length, the error ratio, and the input parameters. Finally, we discuss some significance measures that can be used to sort the patterns output by the algorithm. Contact: pavesi@disco.unimib.it
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
Linear pattern matching algorithms
Weiner, P. (1973) · 14th Annual Symposium on Switching and Automata Theory (swat 1973) · doi:10.1109/swat.1973.13 · Cited by 1,801
A Space-Economical Suffix Tree Construction Algorithm
McCreight, E. M. (1976) · Journal of the ACM · doi:10.1145/321941.321946 · Cited by 1,511
On-line construction of suffix trees
Ukkonen, E. (1995) · Algorithmica · doi:10.1007/bf01206331 · Cited by 1,472
Hertz, G. Z., & Stormo, G. D. (1999) · Bioinformatics · doi:10.1093/bioinformatics/15.7.563 · Cited by 1,243
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
Combinatorial approaches to finding subtle signals in DNA sequences.
Pevzner, P. A., & Sze, S. (2000) · PubMed · Cited by 549
Finding Motifs Using Random Projections
Buhler, J., & Tompa, M. (2002) · Journal of Computational Biology · doi:10.1089/10665270252935430 · Cited by 532
Predicting Gene Regulatory Elements in Silico on a Genomic Scale
Brāzma, A., Jonassen, I., Vilo, J., & Ukkonen, E. (1998) · Genome Research · doi:10.1101/gr.8.11.1202 · Cited by 334
Prediction of transcription regulatory sites in Archaea by a comparative genomic approach
Gelfand, M. S. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.3.695 · Cited by 190
Cited by
The ENCODE Project Consortium (2007) · Nature · doi:10.1038/nature05874 · Cited by 5,223
Chen, X., Xu, H., Yuan, P., Fang, F., Huss, M., Vega, V. B., Wong, E., Orlov, Y. L., Zhang, W., Jiang, J., et al. (2008) · Cell · doi:10.1016/j.cell.2008.04.043 · Cited by 2,501
The Oct4 and Nanog transcription network regulates pluripotency in mouse embryonic stem cells
Loh, Y.-H., Wu, Q., Chew, J.-L., Vega, V. B., Zhang, W., Chen, X., Bourque, G., George, J., Leong, B., Liu, J., et al. (2006) · Nature Genetics · doi:10.1038/ng1760 · Cited by 2,437
Characterization of the CLEAR network reveals an integrated control of cellular clearance pathways
Palmieri, M., Impey, S., Kang, H., di Ronza, A., Pelz, C., Sardiello, M., & Ballabio, A. (2011) · Human Molecular Genetics · doi:10.1093/hmg/ddr306 · Cited by 1,022
iRegulon: From a Gene List to a Gene Regulatory Network Using Large Motif and Track Collections
Janky, R., Verfaillie, A., Imrichová, H., Van de Sande, B., Standaert, L., Christiaens, V., Hulselmans, G., Herten, K., Naval Sanchez, M., Potier, D., et al. (2014) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003731 · Cited by 900
“The string-based approaches rely on the detection of statistically over-represented words (oligonucleotides or spaced motifs) compared to a given background [83–88].”
Metadata
- Authors
- Pavesi, G., Mauri, G., & Pesole, G.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2001-06-01
- Volume
- 17
- Issue
- suppl_1
- Pages
- S207-S214
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2148014281
- Cited by
- 337
- References
- 16
- FWCI
- 7.14
- Type
- journal article
- Language
- en
- Open access
- green
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: An algorithm for finding signals of unknown length in DNA sequences. https://app.cochat.ai/papers/10.1093/bioinformatics/17.suppl_1.s207
- The paper
- Pavesi, G., Mauri, G., & Pesole, G. (2001). An algorithm for finding signals of unknown length in DNA sequences. Bioinformatics. https://doi.org/10.1093/bioinformatics/17.suppl_1.s207
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.