128 citations
- Lyon 1 UniversitéFR12 papers
- Centre National de la Recherche ScientifiqueFR9 papers
- Institut national de recherche en sciences et technologies du numériqueFR4 papers
- Université Paris CitéFR3 papers
- Département mathématiques, informatique, sciences de la donnée et technologies du numériqueFR2 papers
- Laboratoire de Probabilités, Statistique et ModélisationFR2 papers
- Sorbonne UniversitéFR2 papers
- Université de LyonFR2 papers
- Université Grenoble AlpesFR2 papers
- Biologie Computationnelle, Quantitative et SynthétiqueFR1 paper
- Biomathematics and Statistics ScotlandGB1 paper
- Centre de Biologie pour la Gestion des PopulationsFR1 paper
21 papers
Likelihood-free inference of phylogenetic tree posterior distributions
Luc Blassel, Noémie Sauvage, Pierre Barrat-Charlaix +3
Phylogenetic inference, the task of reconstructing how related sequences evolved from common ancestors, is a central objective in evolutionary genomics. The current state-of-the-ar…
Largest planar graphs of diameter and fixed maximum degree -- connection with fractional matchings
Antoine Dailly, Sasha Darmon, Ugo Giocanti +2
The degree diameter problem asks for the maximum possible number of vertices in a graph of maximum degree and diameter . In this paper, we focus on planar graphs of diameter…
The expensive son hypothesis
Lucas Invernizzi, Jean-françois Lemaître, Mathieu Douhard
In its initial form, the expensive son hypothesis postulates that sons from male-biased sexually dimorphic species require more food during growth than daughters, which ultimately…
Inner ear morphology in wild versus laboratory house mice
Sabrina Renaud, Léa Amar, Pascale Chevret +4
The semicircular canals of the inner ear are involved in balance and velocity control. Being crucial to ensure efficient mobility, their morphology exhibits an evolutionary conserv…
Complexity of the Swap Median and Swap Closest Problems
Luís Cunha, Thiago Lopes, Arnaud Mary
Genome rearrangement distances provide a combinatorial framework for comparing genomes represented as permutations. Although the swap distance between two permutations is polynomia…
Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
Arnaud Mary
We consider the problem of enumerating all minimal transversals (also called minimal hitting sets) of a hypergraph . An equivalent formulation of this problem known as…