Mireille Régnier
Mireille Régnier
Ecole polytechnique
Verified email at
Cited by
Cited by
Assessing computational tools for the discovery of transcription factor binding sites
M Tompa, N Li, TL Bailey, GM Church, B De Moor, E Eskin, AV Favorov, ...
Nature biotechnology 23 (1), 137-144, 2005
On pattern frequency occurrences in a Markovian sequence
M Régnier, W Szpankowski
Algorithmica 22, 631-649, 1998
A limiting distribution for quicksort
M Régnier
RAIRO-Theoretical Informatics and Applications 23 (3), 335-343, 1989
Trie partitioning process: limiting distributions
P Jacquet, M Régnier
Colloquium on Trees in Algebra and Programming, 196-210, 1986
Short fuzzy tandem repeats in genomic sequences, identification, and possible role in regulation of gene expression
V Boeva, M Regnier, D Papatsenko, V Makeev
Bioinformatics 22 (6), 676-684, 2006
Extraction of functional binding sites from unique regulatory regions: the Drosophila early developmental enhancers
DA Papatsenko, VJ Makeev, AP Lifanov, M Régnier, AG Nazina, ...
Genome research 12 (3), 470-481, 2002
A unified approach to word occurrence probabilities
M Régnier
Discrete applied mathematics 104 (1-3), 259-280, 2000
Toxicity of carbon dioxide: a review
A Guais, G Brand, L Jacquot, M Karrer, S Dukan, G Grévillot, TJ Molina, ...
Chemical research in toxicology 24 (12), 2061-2070, 2011
Rare events and conditional events on random strings
M Régnier, A Denise
Discrete Mathematics & Theoretical Computer Science 6, 2004
Some uses of the Mellin integral transform in the analysis of algorithms
P Flajolet, M Régnier, R Sedgewick
Combinatorial algorithms on words, 241-254, 1985
Normal limiting distribution of the size of tries
P Jacquet, M Régnier
Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer …, 1987
Analysis of grid file algorithms
M Regnier
BIT Numerical Mathematics 25, 335-357, 1985
Average running time of the Boyer-Moore-Horspool algorithm
RA Baeza-Yates, M Regnier
Theoretical Computer Science 92 (1), 19-31, 1992
On the approximate pattern occurrences in a text
M Régnier, W Szpankowski
Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No …, 1997
New results on the size of tries
M Régnier, P Jacquet
IEEE Transactions on Information Theory 35 (1), 203-205, 1989
On the average height of trees in digital search and dynamic hashing
M Régnier
Information Processing Letters 13 (2), 64-66, 1981
Fast two-dimensional pattern matching
R Baeza-Yates, M Regnier
Information Processing Letters 45 (1), 51-57, 1993
Algebraic methods for trie statistics
P Flajolet, M Régnier, D Sotteau
North-Holland Mathematics Studies 109, 145-188, 1985
Fast algorithms for two dimensional and multiple pattern matching
R Baeza-Yates, M Régnier
Scandinavian Workshop on Algorithm Theory, 332-347, 1990
Exact p-value calculation for heterotypic clusters of regulatory motifs and its application in computational annotation of cis-regulatory modules
V Boeva, J Clément, M Régnier, MA Roytberg, VJ Makeev
Algorithms for molecular biology 2, 1-15, 2007
The system can't perform the operation now. Try again later.
Articles 1–20