Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pavesi, G.
Right arrow Articles by Pesole, G.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Pavesi, G.
Right arrow Articles by Pesole, G.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 17 no. 90001 2001
Pages S207-S214
© 2001 Oxford University Press

An algorithm for finding signals of unknown length in DNA sequences

Giulio Pavesi 1, Giancarlo Mauri 1 and Graziano Pesole 2

1 Department of Computer Science, Systems and Communication, University of Milan–Bicocca, Via Bicocca degli Arcimboldi 8, Milan, I-20126, Italy
2 Department of General Physiology and Biochemistry, University of Milan, Via Celoria 20, Milan, I-20133, Italy

Received on February 5, 2001 ; revised on April 3, 2001 ; accepted on April 3, 2001

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 {epsilon} < 1, finds all patterns that occur in at least q sequences of the set with at most {epsilon}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 {lceil}{epsilon}i{rciel} 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{at}disco.unimib.it


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Genome ResHome page
C. Linhart, Y. Halperin, and R. Shamir
Transcription factor and microRNA motif discovery: The Amadeus platform and a compendium of metazoan target sets
Genome Res., July 1, 2008; 18(7): 1180 - 1189.
[Abstract] [Full Text] [PDF]


Home page
DNA ResHome page
A. Vandenbon, Y. Miyamoto, N. Takimoto, T. Kusakabe, and K. Nakai
Markov Chain-based Promoter Structure Modeling for Tissue-specific Expression Pattern Prediction
DNA Res, February 7, 2008; (2008) dsm034v1.
[Abstract] [Full Text] [PDF]


Home page
Brief Funct Genomic ProteomicHome page
F. Cordero, M. Botta, and R. A. Calogero
Microarray data analysis and mining approaches
Brief Funct Genomic Proteomic, January 22, 2008; (2008) elm034v1.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
E. Wijaya, K. Rajaraman, S.-M. Yiu, and W.-K. Sung
Detection of generic spaced motifs using submotif pattern mining
Bioinformatics, June 15, 2007; 23(12): 1476 - 1485.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
T. Frickey and G. Weiller
Mclip: motif detection based on cliques of gapped local profile-to-profile alignments
Bioinformatics, February 15, 2007; 23(4): 502 - 503.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
K. I. Zeller, X. Zhao, C. W. H. Lee, K. P. Chiu, F. Yao, J. T. Yustein, H. S. Ooi, Y. L. Orlov, A. Shahab, H. C. Yong, et al.
Global mapping of c-Myc binding sites and target gene networks in human B cells
PNAS, November 21, 2006; 103(47): 17834 - 17839.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
D. GuhaThakurta
Computational identification of transcriptional regulatory elements in DNA sequence
Nucleic Acids Res., July 19, 2006; 34(12): 3585 - 3598.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
G. Pavesi, P. Mereghetti, F. Zambelli, M. Stefani, G. Mauri, and G. Pesole
MoD Tools: regulatory motif discovery in nucleotide sequences from co-regulated or homologous genes.
Nucleic Acids Res., July 1, 2006; 34(Web Server issue): W566 - W570.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
L. S Hon and A. N Jain
A deterministic motif finding algorithm with application to the human genome
Bioinformatics, May 1, 2006; 22(9): 1047 - 1054.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
G. Pavesi, P. Mereghetti, G. Mauri, and G. Pesole
Weeder Web: discovery of transcription factor binding sites in a set of sequences from co-regulated genes
Nucleic Acids Res., July 1, 2004; 32(suppl_2): W199 - W203.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
S. Sinha and M. Tompa
Discovery of novel transcription factor binding sites by statistical overrepresentation
Nucleic Acids Res., December 15, 2002; 30(24): 5549 - 5560.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.