default search action
Mireille Régnier
Person information
- affiliation: LIX-Ecole Polytechnique, Palaiseau, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c26]Hua-Ting Yao, Cédric Chauve, Mireille Régnier, Yann Ponty:
Exponentially Few RNA Structures are Designable. BCB 2019: 289-298 - 2016
- [j22]Daria Iakovishina, Isabelle Janoueix-Lerosey, Emmanuel Barillot, Mireille Régnier, Valentina Boeva:
SV-Bay: structural variant detection in cancer genomes using a Bayesian approach with correction for GC-content and read mappability. Bioinform. 32(7): 984-992 (2016) - 2014
- [j21]Mireille Régnier, Evgenia Furletova, Victor Yakovlev, Mikhail A. Roytberg:
Analysis of pattern overlaps and exact computation of P-values of pattern occurrences numbers: case of Hidden Markov Models. Algorithms Mol. Biol. 9: 25 (2014) - [j20]Jérémie Bourdon, Mireille Régnier:
Large deviation properties for patterns. J. Discrete Algorithms 24: 2-11 (2014) - [c25]Mireille Régnier, Billy Fang, Daria Iakovishina:
Clump Combinatorics, Automata, and Word Asymptotics. ANALCO 2014: 62-73 - 2013
- [j19]Olga Berillo, Mireille Régnier, Anatoly Ivashchenko:
Binding of intronic miRNAs to the mRNAs of host genes encoding intronic miRNAs and proteins that participate in tumourigenesis. Comput. Biol. Medicine 43(10): 1374-1381 (2013) - 2011
- [j18]Cédric Saule, Mireille Régnier, Jean-Marc Steyaert, Alain Denise:
Counting RNA Pseudoknotted Structures. J. Comput. Biol. 18(10): 1339-1351 (2011)
2000 – 2009
- 2007
- [j17]Valentina Boeva, Julien Clément, Mireille Régnier, Mikhail A. Roytberg, Vsevolod J. Makeev:
Exact p-value calculation for heterotypic clusters of regulatory motifs and its application in computational annotation of cis-regulatory modules. Algorithms Mol. Biol. 2 (2007) - 2006
- [j16]Valentina Boeva, Mireille Régnier, Dmitri A. Papatsenko, Vsevolod J. Makeev:
Short fuzzy tandem repeats in genomic sequences, identification, and possible role in regulation of gene expression. Bioinform. 22(6): 676-684 (2006) - [j15]Mireille Régnier, Mathias Vandenbogaert:
Comparison of Statistical Significance Criteria. J. Bioinform. Comput. Biol. 4(2): 537-552 (2006) - 2005
- [j14]Fariza Tahi, Stefan Engelen, Mireille Régnier:
P-dcfold or How to Predict all Kinds of Pseudoknots in Rna Secondary Structures. Int. J. Artif. Intell. Tools 14(5): 703-716 (2005) - [c24]Valentina Boeva, Julien Clément, Mireille Régnier, Mathias Vandenbogaert:
Assessing the Significance of Sets of Words. CPM 2005: 358-370 - 2004
- [j13]Mireille Régnier, Alain Denise:
Rare Events and Conditional Events on Random Strings. Discret. Math. Theor. Comput. Sci. 6(2): 191-214 (2004) - 2003
- [c23]Fariza Tahi, Stefan Engelen, Mireille Régnier:
A Fast Algorithm for NA Secondary Structure Prediction Including Pseudoknots. BIBE 2003: 11-17 - 2002
- [j12]Fariza Tahi, Manolo Gouy, Mireille Régnier:
Automatic RNA Secondary Structure Prediction with a Comparative Approach. Comput. Chem. 26(5): 521-530 (2002) - 2001
- [c22]Alain Denise, Mireille Régnier, Mathias Vandenbogaert:
Assessing the Statistical Significance of Overrepresented Oligonucleotides. WABI 2001: 85-97 - 2000
- [j11]Hosam M. Mahmoud, Philippe Flajolet, Philippe Jacquet, Mireille Régnier:
Analytic Variations on Bucket Selection and Sorting. Acta Informatica 36(9/10): 735-760 (2000) - [j10]Mireille Régnier:
A unified approach to word occurrence probabilities. Discret. Appl. Math. 104(1-3): 259-280 (2000) - [c21]Mireille Régnier, Laurent Mouchard:
Periods and Quasiperiods Characterization. CPM 2000: 388-396 - [c20]Mireille Régnier, Alexandre Lifanov, Vsevolod J. Makeev:
Three Variations on Word Counting. German Conference on Bioinformatics 2000: 75-82 - [c19]Mireille Régnier:
Computational Complexity of Word Counting. JOBIM 2000: 99-110
1990 – 1999
- 1998
- [j9]Mireille Régnier, Wojciech Szpankowski:
On Pattern Frequency Occurrences in a Markovian Sequence. Algorithmica 22(4): 631-649 (1998) - [c18]Mireille Régnier, Wojciech Szpankowski:
Complexity of Sequential Pattern Matching Algorithms. RANDOM 1998: 187-199 - [c17]Mireille Régnier:
A unified approach to word statistics. RECOMB 1998: 207-213 - 1997
- [j8]Hosam M. Mahmoud, Robert T. Smythe, Mireille Régnier:
Analysis of Boyer-Moore-Horspool string-matching heuristic. Random Struct. Algorithms 10(1-2): 169-186 (1997) - [c16]Mireille Régnier, Wojciech Szpankowski:
On the approximate pattern occurrences in a text. SEQUENCES 1997: 253-264 - 1993
- [j7]Ricardo A. Baeza-Yates, Mireille Régnier:
Fast Two-Dimensional Pattern Matching. Inf. Process. Lett. 45(1): 51-57 (1993) - [c15]Mireille Régnier, Ladan Rostami:
A Unifying Look at d-Dimensional Periodicities and Space Coverings. CPM 1993: 215-227 - [c14]Françoise Fabret, Mireille Régnier, Eric Simon:
An Adaptive Algorithm for Incremental Evaluation of Production Rules in Databases. VLDB 1993: 455-466 - 1992
- [j6]Mireille Régnier:
Enumeration of bordered words. Le langage de la vache-qui-rit. RAIRO Theor. Informatics Appl. 26: 303-317 (1992) - [j5]Ricardo A. Baeza-Yates, Mireille Régnier:
Average Running Time of the Boyer-Moore-Horspool Algorithm. Theor. Comput. Sci. 92(1): 19-31 (1992) - [c13]Mireille Régnier:
A Language Approach to String Searching Evaluation. CPM 1992: 15-26 - [c12]Françoise Fabret, Mireille Régnier, Eric Simon:
Optimizing Incremental Computation of Datalog Programs with Non-deterministic Semantics. ICDT 1992: 155-170 - 1991
- [c11]Luc Albert, Mireille Régnier:
Complexity of Recursive Production Rules Execution. MFDBS 1991: 188-200 - 1990
- [c10]Ricardo A. Baeza-Yates, Gaston H. Gonnet, Mireille Régnier:
Analysis of Boyer-Moore-Type String Searching Algorithms. SODA 1990: 328-343 - [c9]Ricardo A. Baeza-Yates, Mireille Régnier:
Fast Algorithms for Two Dimensional and Multiple Pattern Matching (Preliminary Version). SWAT 1990: 332-347
1980 – 1989
- 1989
- [j4]Mireille Régnier:
A Limiting Distribution for Quicksort. RAIRO Theor. Informatics Appl. 23(3): 335-343 (1989) - [j3]Mireille Régnier, Philippe Jacquet:
New results on the size of tries. IEEE Trans. Inf. Theory 35(1): 203-205 (1989) - [c8]Mireille Régnier, Eric Simon:
Efficient evaluation of production rules in a DBMS. BDA 1989: 131- - [c7]Mireille Régnier:
Knuth-Morris-Pratt Algorithm: An Analysis. MFCS 1989: 431-444 - [c6]Fabrizio Luccio, Mireille Régnier, René Schott:
Discs and Other Related Data Structures. WADS 1989: 192-205 - 1988
- [c5]Mireille Régnier:
Trie Hashing Analysis. ICDE 1988: 377-381 - 1987
- [c4]Philippe Jacquet, Mireille Régnier:
Normal Limiting Distribution of the Size of Tries. Performance 1987: 209-223 - 1986
- [c3]Philippe Jacquet, Mireille Régnier:
Trie Partitioning Process: Limiting Distributions. CAAP 1986: 196-210 - 1985
- [j2]Mireille Régnier:
Analysis of Grid File Algorithms. BIT 25(2): 335-357 (1985) - 1984
- [c2]Mireille Régnier:
Grid File Algorithms: An Analysis in the Biased Case. FSTTCS 1984: 393-418 - 1982
- [c1]Mireille Régnier:
Linear Hashing with Groups of Reorganization: An Algorithms for Files without History. JCDKB 1982: 257-272 - 1981
- [j1]Mireille Régnier:
On the Average Height of Trees in Digital Search and Dynamic Hashing. Inf. Process. Lett. 13(2): 64-66 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint