The myriad virtues of subword trees in Combinatorial Algorithms on Words, NATO ASI Series F12, 1985. ,
Risotto: Fast extraction of motifs with mismatches, Proc. of the 7th Latin American Symposium on Theoretical Informatics (LATIN'06), pp.757-768, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00428023
Exact string matching algorithms, 2004. ,
String matching techniques for musical similarity and melodic recognition, Computing in Musicology, vol.11, pp.73-100, 1998. ,
Bases of motifs for generating repeated patterns with wild cards, IEEE/ACM Trans. Comput. Biol. Bioinformatics, vol.2, issue.1, pp.40-50, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00427800
Longest repeats with a block of don't cares, Proc. of the Latin American Theoretical Informatics, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00619567
Text algorithms, 1994. ,
URL : https://hal.archives-ouvertes.fr/hal-00619796
A highly scalable algorithm for the extraction of cis-regulatory regions, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00427723
Algorithms on strings, trees, and sequences: computer science and computational biology, 1997. ,
DOI : 10.1017/CBO9780511574931
A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS, International Journal of Foundations of Computer Science, vol.16, issue.06, 2004. ,
DOI : 10.1142/S0129054105003716
URL : https://hal.archives-ouvertes.fr/inria-00328042
Finding Motifs with Insufficient Number of Strong Binding Sites, Journal of Computational Biology, vol.12, issue.6, pp.686-701, 2005. ,
DOI : 10.1089/cmb.2005.12.686
Extracting structured motifs using a suffix tree -algorithms and application to promoter consensus identification, RECOMB '00: Proceedings of the fourth annual international conference on Computational molecular biology, pp.210-219, 2000. ,
URL : https://hal.archives-ouvertes.fr/hal-00427093
Bioinformatics : sequence and genome analysis, 2001. ,
Spelling approximate repeated or common motifs using a suffix tree, LATIN '98: Proceedings of the Third Latin American Symposium on Theoretical Informatics, pp.374-390, 1998. ,
DOI : 10.1007/BFb0054337
URL : https://hal.archives-ouvertes.fr/hal-00428511