74 citations
- Laboratoire d'Informatique Gaspard-MongeFR20 papers
- Université Gustave EiffelFR8 papers
- Laboratoire d'Informatique, Signaux et Systèmes de Sophia AntipolisFR2 papers
- Laboratoire Traitement et Communication de l’InformationFR2 papers
- Disco (Germany)DE1 paper
- Institut Camille JordanFR1 paper
- Institut de Mathématiques de MarseilleFR1 paper
- Instituto de Gastroenterologia de GoiâniaBR1 paper
- International Center for Transitional JusticeUS1 paper
- Laboratoire Bordelais de Recherche en InformatiqueFR1 paper
- Laboratoire d'Astrophysique de BordeauxFR1 paper
- Laboratoire de Physique ThéoriqueFR1 paper
5 papers · 1 filter
Comparing RNA structures using a full set of biologically relevant edit operations is intractable
Guillaume Blin, Sylvie Hamel, Stéphane Vialette
Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence and structu…
Application of graph combinatorics to rational identities of type A
Adrien Boussicault, Valentin Féray
To a word , we associate the rational function . The main object, introduced by C. Greene to generalize identities linked to Murnaghan-…
Analysis and comparison of precise long-term nutation series, strictly determined with OCCAM 6.1 VLBI software
G. Bourda, J. Boehm, R. Heinkelmann +1
The IAU/IUGG Working Group on "Nutation for a non-rigid Earth", led by Véronique Dehant, won the European Descartes Prize in 2003, for its work developing a new model for the prece…
A compact topology for sand automata
Alberto Dennunzio, Pierre Guillon, Benoît Masson
In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology fo…
Understanding maximal repetitions in strings
Maxime Crochemore, Lucian Ilie
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simp…