871 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR34 papers
- Lyon 1 UniversitéFR33 papers
- Université de LyonFR14 papers
- Institut national de recherche en sciences et technologies du numériqueFR10 papers
- École Normale Supérieure de LyonFR6 papers
- Centre Inria de l'Université Grenoble AlpesFR5 papers
- Université Grenoble AlpesFR5 papers
- Institut polytechnique de GrenobleFR4 papers
- Laboratoire de Probabilités, Statistique et ModélisationFR4 papers
- Sorbonne UniversitéFR4 papers
- Université de MontpellierFR4 papers
- Université Paris CitéFR4 papers
9 papers · 1 filter
Adaptive Lasso and group-Lasso for functional Poisson regression
S. Ivanoff, F. Picard, V. Rivoirard
High dimensional Poisson regression has become a standard framework for the analysis of massive counts datasets. In this work we estimate the intensity function of the Poisson regr…
Weighted Statistical Binning: enabling statistically consistent genome-scale phylogenetic analyses
Md. Shamsuzzoha Bayzid, Siavash Mirarab, Bastien Boussau +1
Because biological processes can make different loci have different evolutionary histories, species tree estimation requires multiple loci from across the genome. While many proces…
Computing an Evolutionary Ordering is Hard
Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri
We prove that computing an evolutionary ordering of a family of sets, i.e. an ordering where each set intersects with --but is not included in-- the union earlier sets, is NP-hard.
Amortized -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs
Rui Ferreira, Roberto Grossi, Romeo Rizzi +2
Chordless cycles are very natural structures in undirected graphs, with an important history and distinguished role in graph theory. Motivated also by previous work on the classica…
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary +2
An output-polynomial algorithm for the listing of minimal dominating sets in graphs is a challenging open problem and is known to be equivalent to the well-known Transversal proble…
Enhancing Boolean networks with continuous logical operators and edge tuning
Arnaud Poret, Claudio Monteiro Sousa, Jean-Pierre Boissel
Due to the scarcity of quantitative details about biological phenomena, quantitative modeling in systems biology can be compromised, especially at the subcellular scale. One way to…
Efficient Algorithms for de novo Assembly of Alternative Splicing Events from RNA-seq Data
Gustavo Sacomoto
In this thesis, we address the problem of identifying and quantifying variants (alternative splicing and genomic polymorphism) in RNA-seq data when no reference genome is available…
Triangle counting in dynamic graph streams
Laurent Bulteau, Vincent Froese, Konstantin Kutzkov +1
Estimating the number of triangles in graph streams using a limited amount of memory has become a popular topic in the last decade. Different variations of the problem have been st…
Spatially-constrained clustering of ecological networks
Vincent Miele, Franck Picard, Stéphane Dray
Spatial ecological networks are widely used to model interactions between georeferenced biological entities (e.g., populations or communities). The analysis of such data often lead…