String matching and other products, SIAM-AMS proceedings, pp.113-125, 1974. ,
Pattern discovery on character sets and real-valued data : linear bound on irredundant motifs and an efficient polynomial time algorithm, Proceedings of the 11th Symposium on Discrete Algorithms, pp.297-308, 2000. ,
Indexation de motifs approchés, 2000. ,
Un algorithme d'indexation de motifs approchés (poster and short talk), Journées Ouvertes Biologie Informatique Mathématiques, Saint- Malo, pp.263-264, 2002. ,
Extracting approximate patterns, Proceedings of the 14th annual symposium on Combinatorial Pattern Matching, pp.328-347, 2003. ,
Bases of motifs for generating repeated patterns with don't cares, 2003. ,
A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum, proceedings of Mathematical Foundations of Computer Science (MFCS), pp.622-632, 2003. ,
DOI : 10.1007/978-3-540-45138-9_56
URL : https://hal.archives-ouvertes.fr/hal-00620116
q-gram analysis and urn models, Discrete Random Walks 2003, pp.243-257, 2003. ,
Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts, Proc. of the 11th Symposium on Combinatorial Pattern Matching, pp.375-387, 2000. ,
Similarity vs. distance in whole genome comparison, Mathematics of Evolution and Phylogeny Workshop, 2003. ,
The Algorithmic of Gene Teams, Bioinformatics, 2002. ,
DOI : 10.1007/3-540-45784-4_36
Finding All Common Intervals of k Permutations, Lecture Notes in Computer Science, 2001. ,
DOI : 10.1007/3-540-48194-X_19
Gene context conservation of higher order than operons, Trends in Biochemical Sciences, 2000. ,
The use of gene clusters to infer functional coupling, Proc. Natl. Acad. Sci. USA, 1999. ,
DOI : 10.1073/pnas.96.6.2896
Connected gene neighborhoods in prokaryotic genomes, Nucleic Acids Research, vol.30, issue.10, 2002. ,
DOI : 10.1093/nar/30.10.2212
Efficient probabilistically checkable proofs and applications to approximations, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.294-304, 1993. ,
DOI : 10.1145/167088.167174
Compendium of parameterized problems ,
A threshold of ln n for approximating set cover, Journal of the ACM, vol.45, issue.4, pp.634-652, 1998. ,
DOI : 10.1145/285055.285059
A new approach to primer selection in polymerase chain reaction experiments, Discrete and Applied Mathematics, vol.71, pp.1-3231, 1996. ,