Mireille Régnier

According to our database1, Mireille Régnier
  • authored at least 46 papers between 1981 and 2016.
  • has a "Dijkstra number"2 of four.



In proceedings 
PhD thesis 


On csauthors.net:


SV-Bay: structural variant detection in cancer genomes using a Bayesian approach with correction for GC-content and read mappability.
Bioinformatics, 2016

Large deviation properties for patterns.
J. Discrete Algorithms, 2014

Analysis of pattern overlaps and exact computation of P-values of pattern occurrences numbers: case of Hidden Markov Models.
Algorithms for Molecular Biology, 2014

Clump Combinatorics, Automata, and Word Asymptotics.
Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

Binding of intronic miRNAs to the mRNAs of host genes encoding intronic miRNAs and proteins that participate in tumourigenesis.
Comp. in Bio. and Med., 2013

Counting RNA Pseudoknotted Structures.
Journal of Computational Biology, 2011

Exact p-value calculation for heterotypic clusters of regulatory motifs and its application in computational annotation of cis-regulatory modules.
Algorithms for Molecular Biology, 2007

Comparison of Statistical Significance Criteria.
J. Bioinformatics and Computational Biology, 2006

Short fuzzy tandem repeats in genomic sequences, identification, and possible role in regulation of gene expression.
Bioinformatics, 2006

P-dcfold or How to Predict all Kinds of Pseudoknots in Rna Secondary Structures.
International Journal on Artificial Intelligence Tools, 2005

Assessing the Significance of Sets of Words.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

Rare Events and Conditional Events on Random Strings.
Discrete Mathematics & Theoretical Computer Science, 2004

A Fast Algorithm for NA Secondary Structure Prediction Including Pseudoknots.
Proceedings of the 3rd IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2003), 2003

Automatic RNA Secondary Structure Prediction with a Comparative Approach.
Computers & Chemistry, 2002

Assessing the Statistical Significance of Overrepresented Oligonucleotides.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

A unified approach to word occurrence probabilities.
Discrete Applied Mathematics, 2000

Analytic Variations on Bucket Selection and Sorting.
Acta Inf., 2000

Computational Complexity of Word Counting.
Proceedings of the Computational Biology, 2000

Three Variations on Word Counting.
Proceedings of the German Conference on Bioinformatics (GCB 2000), 2000

Periods and Quasiperiods Characterization.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

On Pattern Frequency Occurrences in a Markovian Sequence.
Algorithmica, 1998

A unified approach to word statistics.
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998

Complexity of Sequential Pattern Matching Algorithms.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

Analysis of Boyer-Moore-Horspool string-matching heuristic.
Random Struct. Algorithms, 1997

Fast Two-Dimensional Pattern Matching.
Inf. Process. Lett., 1993

An Adaptive Algorithm for Incremental Evaluation of Production Rules in Databases.
Proceedings of the 19th International Conference on Very Large Data Bases, 1993

A Unifying Look at d-Dimensional Periodicities and Space Coverings.
Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

Average Running Time of the Boyer-Moore-Horspool Algorithm.
Theor. Comput. Sci., 1992

Enumeration of bordered words. Le langage de la vache-qui-rit.
ITA, 1992

Optimizing Incremental Computation of Datalog Programs with Non-deterministic Semantics.
Proceedings of the Database Theory, 1992

A Language Approach to String Searching Evaluation.
Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

Complexity of Recursive Production Rules Execution.
Proceedings of the MFDBS 91, 1991

Fast Algorithms for Two Dimensional and Multiple Pattern Matching (Preliminary Version).
Proceedings of the SWAT 90, 1990

Analysis of Boyer-Moore-Type String Searching Algorithms.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

New results on the size of tries.
IEEE Trans. Information Theory, 1989

A Limiting Distribution for Quicksort.
ITA, 1989

Discs and Other Related Data Structures.
Proceedings of the Algorithms and Data Structures, 1989

Knuth-Morris-Pratt Algorithm: An Analysis.
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

Efficient evaluation of production rules in a DBMS.
Proceedings of the Cinquièmes Journées Bases de Données Avancées, 1989

Trie Hashing Analysis.
Proceedings of the Fourth International Conference on Data Engineering, 1988

Normal Limiting Distribution of the Size of Tries.
Proceedings of the Performance '87, 1987

Trie Partitioning Process: Limiting Distributions.
Proceedings of the CAAP '86, 1986

Analysis of Grid File Algorithms.
BIT, 1985

Grid File Algorithms: An Analysis in the Biased Case.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1984

Linear Hashing with Groups of Reorganization: An Algorithms for Files without History.
JCDKB, 1982

On the Average Height of Trees in Digital Search and Dynamic Hashing.
Inf. Process. Lett., 1981