70 citations · 207 across the 23 of their papers we have counts for
4 papers · 1 filter
odeN: Simultaneous Approximation of Multiple Motif Counts in Large Temporal Networks
Ilie Sarpe, Fabio Vandin
Counting the number of occurrences of small connected subgraphs, called temporal motifs, has become a fundamental primitive for the analysis of temporal networks, whose edges are a…
SILVAN: Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Bounds
Leonardo Pellegrina, Fabio Vandin
Betweenness centrality is a popular centrality measure with applications in several domains, and whose exact computation is impractical for modern-sized networks. We present SILVAN…
PRESTO: Simple and Scalable Sampling Techniques for the Rigorous Approximation of Temporal Motif Counts
Ilie Sarpe, Fabio Vandin
The identification and counting of small graph patterns, called network motifs, is a fundamental primitive in the analysis of networks, with application in various domains, from so…
SPRISS: Approximating Frequent -mers by Sampling Reads, and Applications
Diego Santoro, Leonardo Pellegrina, Fabio Vandin
The extraction of -mers is a fundamental component in many complex analyses of large next-generation sequencing datasets, including reads classification in genomics and the char…