output
20092025
most citedHigh-resolution measurements of face-to-face contact patterns in a primary school

871 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.DSShow all

7 papers · 1 filter

cs.DS2017★ 11 cited

Gene tree reconciliation including transfers with replacement is hard and FPT

Damir Hasic, Eric Tannier

Phylogenetic trees illustrate the evolutionary history of genes and species. In most cases, although genes evolve along with the species they belong to, a species tree and gene tre…

cs.DS2014★ 2 cited

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…

cs.DS2014★ 3 cited

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…

cs.DS2014

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…

cs.DS2014★ 18 cited

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…

cs.DS2013★ 3 cited

Using cascading Bloom filters to improve the memory usage for de Brujin graphs

Kamil Salikhov, Gustavo Sacomoto, Gregory Kucherov

De Brujin graphs are widely used in bioinformatics for processing next-generation sequencing data. Due to a very large size of NGS datasets, it is essential to represent de Bruijn…

cs.DS2010★ 3 cited

Mod/Resc Parsimony Inference

Igor Nor, Danny Hermelin, Sylvain Charlat +4

We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insect populati…