Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975. ,
DOI : 10.1145/360825.360855
Incremental Paradigms of Motif Discovery, Journal of Computational Biology, vol.11, issue.1, pp.15-25, 2004. ,
DOI : 10.1089/106652704773416867
A new approach to text searching, Communications of the ACM, vol.35, issue.10, pp.74-82, 1992. ,
DOI : 10.1145/135239.135243
Approaches to the Automatic Discovery of Patterns in Biosequences, Journal of Computational Biology, vol.5, issue.2, pp.279-305, 1998. ,
DOI : 10.1089/cmb.1998.5.279
Jewels of Stringology, 2002. ,
DOI : 10.1142/4838
URL : https://hal.archives-ouvertes.fr/hal-00619795
From profiles to patterns and back again, Proceedings of the eighth annual international conference on Computational molecular biology , RECOMB '04, pp.115-124, 2004. ,
DOI : 10.1145/974614.974630
GENOME-WIDE ANALYSIS OF BACTERIAL PROMOTER REGIONS, Biocomputing 2003, pp.29-40, 2003. ,
DOI : 10.1142/9789812776303_0004
String matching and other products, SIAM AMS Complexity of Computation, pp.113-125, 1974. ,
Profile analysis: detection of distantly related proteins., Proc. Natl. Acad. Sci. USA, pp.4355-4358, 1987. ,
DOI : 10.1073/pnas.84.13.4355
Algorithms on strings, trees and sequences: computer science and computational biology, 1997. ,
DOI : 10.1017/CBO9780511574931
[2] Escherichia coli promoter sequences: Analysis and prediction, Meth. Enzymol, vol.273, pp.30-42, 1996. ,
DOI : 10.1016/S0076-6879(96)73004-5
Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment, Science, vol.262, issue.5131, pp.208-214, 1993. ,
DOI : 10.1126/science.8211139
An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences, Proteins: Structure, Function, and Genetics, vol.240, issue.1, pp.41-51, 1990. ,
DOI : 10.1002/prot.340070105
Algorithms for Extracting Structured Motifs Using a Suffix Tree with an Application to Promoter and Regulatory Site Consensus Identification, Journal of Computational Biology, vol.7, issue.3-4, pp.345-362, 2000. ,
DOI : 10.1089/106652700750050826
Comparison of genomic DNA sequences: solved and unsolved problems, Bioinformatics, vol.17, issue.5, pp.391-397, 2001. ,
DOI : 10.1093/bioinformatics/17.5.391
A fast bit-vector algorithm for approximate string matching based on dynamic programming, Journal of the ACM, vol.46, issue.3, pp.395-415, 1999. ,
DOI : 10.1145/316542.316550
Pattern Discovery on Character Sets and Real-valued Data: Linear Bound on Irredundant Motifs and Efficient Polynomial Time Algorithm, SIAM Symposium on Discrete Algorithms (SODA), 2000. ,
An Output-Sensitive Flexible Pattern Discovery Algorithm, Combinatorial Pattern Matching, pp.131-142, 2001. ,
DOI : 10.1007/3-540-48194-X_11
Extracting approximate patterns, Combinatorial Pattern Matching, pp.328-347, 2003. ,
A basis for repeated motifs in pattern discovery and text mining, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-00627828
A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum, Mathematical Foundations of Computer Science, pp.622-631, 2003. ,
DOI : 10.1007/978-3-540-45138-9_56
URL : https://hal.archives-ouvertes.fr/hal-00620116
NATO volume on String Algorithmics, chapter A Comparative Study of Bases for Motif Inference, 2004. ,
Benchmarking tools for the alignment of functional noncoding dna, BMC Bioinformatics, vol.5, issue.1, pp.6-23, 2004. ,
DOI : 10.1186/1471-2105-5-6
Promoter sequences and algorithmical methods for identifying them, Research in Microbiology, vol.150, issue.9-10, pp.779-799, 1999. ,
DOI : 10.1016/S0923-2508(99)00115-1
URL : https://hal.archives-ouvertes.fr/hal-00428461
Path-matching problems, Algorithmica, vol.5, issue.1-6, pp.89-101, 1992. ,
DOI : 10.1007/BF01758837