Publications by Mireille Régnier

2009

Galina Boldina, Anatoly Ivashchenko, and Mireille Régnier

. — Using profiles based on nucleotide hydrophobicity to define essential regions for splicing. — International Journal of Biological Sciences, 5 n°1:13–19, 2009.

2008

BibTeX

M. Régnier, G. Furletova, M. Roytberg and Z. Kirakossian

. — An Overlap Counting Graph. — LONDON ALGORITHMICS 2008: THEORY AND PRACTICE; to appear in Special Issue for Maxime Crochemore's birthday, 2008.

2007

BibTeX

Valentina Boeva, Julien Clément, Mireille Régnier, Mikhail Roytberg, and Vsevolod Makeev

. — Exact p-value calculation for heterotypic clusters of regulatory motifs and its application in computational annotation of cis-regulatory modules. — Algorithms for molecular biology, 2 n°13:25 pages, 2007.

2006

BibTeX

V. Boeva, V. Makeev, D. Papatsenko, and M. Régnier

. — Short fuzzy tandem repeats in genomic sequences, identification, and possible role in regulation of gene expression. — Bioinformatics, 22 n°6:676–684, 2006.

BibTeX

M. Régnier and M. Vandenbogaert

. — Comparison of statistical significance criteria. — Journal of Bioinformatics and Computational Biology, 4 n°2:537–551, 2006.

2005

BibTeX

V. Boeva, J. Clément, M. Régnier, and M. Vandenbogaert

. — Assessing the significance of Sets of Words. — In Combinatorial Pattern Matching 05, Lecture Notes in Computer Science, vol. 3537, pages 358–370. Springer Verlag, 2005. — In Proceedings CPM'05, Jeju Island, Korea.

BibTeX

Fariza Tahi, Stefan Engelen, and Mireille Régnier

. — P-dcfold or how to predict all kinds of pseudoknots in RNA secondary structures. — International Journal on Artificial Intelligence Tools, 5 n°14:703–716, 2005.

BibTeX

M. Tompa, N. Li, T.L. Bailey, G.M. Church, B. De Moor, E. Eskin, A.V. Favorov, M.C. Frith, Y. Fu, J.W. Kent, V.J. Makeev, A.A. Mironov, W.S. Noble, G. Pavesi, G. Pesole, M. Régnier, N. Simonis, S. Sinha, G. Thijs, J. van Helden, M. Vandenbogaert, Z. Weng, C. Workman, C. Ye, and Z. Zhu

. — An assessment of computational tools for the discovery of transcription factor binding sites. — Nature Biotechnology, 23 n°1:137 – 144, January 2005.

2004

BibTeX

V. Boeva, V. Makeev, and M. Régnier

. — SWAN: searching for highly divergent tandem repeats in DNA sequences and statistical significance. — In JOBIM'04. IEEE Computer Society, 2004. — In Proceedings JOBIM'04, Montréal.

BibTeX

M. Lescot and M. Régnier

. — Motif statistics on plants datasets. — Biophysics, 48 n°1:1–6, 2004. — Proc. Moscow Conference on Computational Molecular Biology, MCCMB'03.

BibTeX

Mireille Régnier

. — Mathematical tools for regulatory signals extraction. — In N. Kolchanov and R. Hofestaedt, editors, Bioinformatics of Genome Regulation and Structure, pages 61–70. Kluwer Academic Publisher, 2004. — Preliminary version at BGRS'02.

BibTeX

Mireille Régnier and Alain Denise

. — Rare events and conditional events on random strings. — DMTCS, 6 n°2:191–214, 2004.

BibTeX

M. Régnier and F. Tahi

. — Generating functions in computational biology. — Journal of Iranian Statistics, 2004. — Preliminary version at MABS'97; to appear.

2003

BibTeX

M. Régnier and A. Denise

. — Statistiques extrêmes sur les mots. — In XXXV-èmes Journées de Statistique, vol. 2, pages 799–802, 2003. — In Proceedings XXXV-èmes Journées de Statistique, Lyon.

BibTeX

F. Tahi, S. Engelen, and M. Régnier

. — A fast algorithm for RNA secondary structure prediction including pseudoknots approach. — In BIBE'03, pages 11–17. IEEE Computer Society, 2003. — In Proceedings BIBE'03, Washington DC.

2002

BibTeX

Dmitri A. Papatsenko, Vsevolod J. Makeev, Alex P. Lifanov, Mireille Régnier, Anna G. Nazina, and Claude Desplan

. — Extraction of functional binding sites from unique regulatory regions: The drosophila early developmental enhancers. — Genome Research, 12 n°3:470–481, 2002.

BibTeX

F. Tahi, M. Gouy, and M. Régnier

. — Automatic RNA secondary structure prediction with a comparative approach. — Computers and Chemistry, 26 n°5:521–530, 2002. — poster at RECOMB'01 and MFRS'01; Montréal.

2001

BibTeX

A. Denise, M. Régnier, and M. Vandenbogaert

. — Assessing statistical significance of overrepresented oligonucleotides. — In WABI'01, pages 85–97. Springer-Verlag, 2001. — Proc. First Intern. Workshop on Algorithms in Bioinformatics, Aarhus, Denmark, August 2001.

BibTeX

M. Régnier

. — Complexity of Unusual Words Counting. — In JOBIM'00, Lecture Notes in Computer Science, vol. 2066, pages 101–117. Springer-Verlag, 2001. — Proceedings of JOBIM'00, Montpellier.

2000

BibTeX

Daniel Hirschberg and Mireille Régnier

. — Tight Bounds on the Number of String Subsequences. — Journal of Discrete Algorithms, 1 n°1:123–132, 2000. — preliminary version at CPM'99.

BibTeX

Hosam Mahmoud, Philippe Flajolet, Philippe Jacquet, and Mireille Régnier

. — Analytic variations on bucket selection and sorting. — Acta Informatica, 36 n°9-10:735–760, 2000.

BibTeX

M. Régnier

. — A unified approach to word occurrences probabilities. — Discrete Applied Mathematics, 104 n°1:259–280, 2000. — Special issue on Computational Biology.

BibTeX

M. Régnier and L. Mouchard

. — Periods and quasiperiods characterization. — In CPM'00, Lecture Notes in Computer Science, vol. 1848, pages 388–396. Springer-Verlag, 2000. — Proc. 11-th Annual Symposium on Combinatorial Pattern Matching, CPM'00, Montreal.

BibTeX

M. Régnier, A. Lifanov, and V. Makeev

. — Three variations on word counting. — In GCB'00, pages 75–82. Logos-Verlag, 2000. — Proceedings German Conference on Bioinformatics, Heidelberg.

1998

BibTeX

M. Régnier

BibTeX

M. Régnier
. — A Unified Approach to Word Statistics. — In RECOMB'98. ACM, 1998.

BibTeX

Mireille Régnier and Wojciech Szpankowski
. — On pattern frequency occurrences in a markovian sequence?. — Algorithmica, 22 n°4:631–649, 1998. — This paper was presented in part at the 1997 International Symposium on Information Theory, Ulm, Germany.

BibTeX

Mireille Régnier and Wojciech Szpankowski
. — On the approximate pattern occurrences in a text. — In Compression and Complexity of SEQUENCES 1997, pages 253–264. IEEE Computer Society, 1998. — Proceedings SEQUENCE'97, Positano, Italy.

BibTeX

Mireille Régnier and Wojtek Szpankowski
. — Complexity of Sequential Pattern Matching Algorithms. — In RANDOM'98, Lecture Notes in Computer Science, n°1518 in Lecture Notes in Computer Science, pages 187–199. Springer-Verlag, 1998.

1997

BibTeX

H. Mahmoud, M. Régnier, and R. Smythe

. — Analysis of Boyer-Moore-Horspool String-Matching Heuristic. — Random Structures and Algorithms, 10:169–186, 1997.

BibTeX

Hosam M. Mahmoud, Robert T. Smythe, and Mireille Régnier

. — Analysis of Boyer-Moore-Horspool string-matching heuristic. — Random Structures and Algorithms, 10 n°1-2:169–186, 1997.

BibTeX

Mireille Régnier and Wojciech Szpankowski

. — On the approximate pattern occurrences in a text. — In IEEE Computer Society, editor, Compression and Complexity of SEQUENCES 1997, pages 253–264, 1997. — In Proceedings SEQUENCE'97,Positano, Italy.

1996

BibTeX

Mireille Régnier and Ladan Rostami

. — A simple (but optimal) 2d-witness algorithm. — In Third South American Workshop on String Processing, International Informatics Series, n°4 in International Informatics Series, pages 243–256, 1996.

BibTeX

M. Régnier and F. Tahi

. — Enumeration and asymptotics in computational biology. — In Mathematical Analysis for Biological Sequences, 1996. — Proceedings of a workshop held in Trondheim, Norway.

1993

BibTeX

R. Baeza-Yates and M. Régnier

. — Fast algorithms for two dimensional and multiple pattern matching. — Information Processing Letters, 45 n°1:51–57, 1993.

BibTeX

F. Fabret, M. Régnier, and E. Simon

. — An Adaptative Algorithm for Incremental Evaluation of Production Rules in Databases. — In VLDB'93, IEEE, IEEE, pages 455–466. M. Kaufmann, 1993. — Proc. 19th International Conference on Very Large Databases, Dublin, Ireland.

BibTeX

M. Régnier and L. Rostami

. — A Unifying Look at d-dimensional Periodicities and Space Coverings. — In CPM'93, Lecture Notes in Computer Science, vol. 684, pages 215–227. Springer-Verlag, 1993. — Proceedings 4th Symposium on Combinatorial Pattern Matching, Padova, Italy.

1992

BibTeX

R. Baeza-Yates and M. Régnier

. — Average running time of Boyer-Moore-Horspool algorithm. — Theoretical Computer Science, 92:19–31, 1992. — special issue.

BibTeX

F. Fabret, M. Régnier, and E. Simon

. — Optimizing incremental computation of datalog programs with non-deterministic semantics. — In ICDT'92, Lecture Notes in Computer Science, vol. 646, pages 155–170. Springer-Verlag, 1992. — Proc. 4-th International Conference on Database Theory, Berlin, Germany.

BibTeX

M. Régnier

. — Enumeration of bordered words. — RAIRO Theoretical Informatics and Applications, 26 n°4:303–317, 1992.

BibTeX

M. Régnier

. — A language approach to string searching evaluation. — In CPM'92, Lecture Notes in Computer Science, vol. 644, pages 15–26. Springer-Verlag, 1992. — Proc. 3-rd Symposium on Combinatorial Pattern Matching, Tucson, Arizona.

1991

BibTeX

L. Albert and M. Regnier

. — Complexity of recursive production rules execution. — In Third International Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Goehren, Germany, May 1991.

BibTeX

L. Albert and M. Régnier

. — Graph applications to recursive production rules programs. — In MFDBS'91, Goehren, Germany, 1991.

BibTeX

M. Régnier

. — Mots et motifs : performances asymptotiques. — Habilitation à diriger des recherches, Univ. Paris-Sud, Orsay, France, 1991.

1990

BibTeX

R. Baeza-Yates and M. Régnier

. — Fast algorithms for two dimensional and multiple pattern matching. — In SWAT'90, Lecture Notes in Computer Science, vol. 447, pages 332–347. Springer-Verlag, 1990. — Proc. Swedish Workshop on Algorithm Theory, Bergen, Norway.

BibTeX

R. Baeza-Yates, G. Gonnet, and M. Régnier

. — Analysis of Boyer-Moore-type string searching algorithms. — In Proc. first SIAM-ACM Symposium on Discrete Algorithms, pages 328–343. SIAM, 1990. — SODA '90, San Francisco, January 22–24, 1990.

1989

BibTeX

Ph. Jacquet and M. Régnier

. — New results on the size of tries. — IEEE Transactions on Information Theory, 35 n°1:203–205, 1989.

BibTeX

F. Luccio, M. Régnier, and R. Schott

. — Discs and other related data structures. — In Algorithms and data structures, Lecture Notes in Computer Science, vol. 382, pages 192–205. Springer-Verlag, 1989. — Proceedings of the workshop WADS'89, Ottawa, August 17-19, 1989.

BibTeX

M. Régnier

. — Knuth-Morris-Pratt algorithm: an analysis. — In MFCS'89, Lecture Notes in Computer Science, vol. 379, pages 431–444. Springer-Verlag, 1989. — Proceedings Mathematical Foundations for Computer Science 89, Porubka, Poland.

BibTeX

M. Régnier

. — The limiting distribution of quicksort. — RAIRO Theoretical Informatics and Applications, 23 n°3:335–343, 1989.

BibTeX

M. Régnier and E. Simon

. — Efficient evaluation of rules in a DBMS. — In BD3 89, pages 131–154. INRIA, 1989. — Proceedings des 6-èmes Journées Bases de Données Avancées.

1988

BibTeX

M. Régnier

. — Trie hashing analysis. — In IEEE, editor, DE4, vol. 827, pages 377–381. Computer Society Press, 1988. — Proceedings of the 4-th International Conference on Data Engineering, Los Angeles.