18 citations · 24 across the 10 of their papers we have counts for
13 papers
Compact Path Representation in DAGs via Colored Edge Pebbling
Paola Bonizzoni, Alessio Conte, Gianluca Della Vedova +3
Compactly representing a variation graph is a core problem in computational pangenomics that is usually attacked with techniques that have been originated on texts and adapted to g…
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi +4
Graphlets of order in a graph are connected subgraphs induced by nodes (called -graphlets) or by edges (called edge -graphlets). They are among the interestin…
A Compact DAG for Storing and Searching Maximal Common Subsequences
Alessio Conte, Roberto Grossi, Giulia Punzi +1
Maximal Common Subsequences (MCSs) between two strings X and Y are subsequences of both X and Y that are maximal under inclusion. MCSs relax and generalize the well known and widel…
Computing matching statistics on Wheeler DFAs
Alessio Conte, Nicola Cotumaccio, Travis Gagie +3
Matching statistics were introduced to solve the approximate string matching problem, which is a recurrent subroutine in bioinformatics applications. In 2010, Ohlebusch et al. [SPI…
Generalizing Downsampling from Regular Data to Graphs
Davide Bacciu, Alessio Conte, Francesco Landolfi
Downsampling produces coarsened, multi-resolution representations of data and it is used, for example, to produce lossy compression and visualization of large images, reduce comput…
Efficient Estimation of Graph Trussness
Alessio Conte, Roberto Grossi, Andrea Marino +1
A -truss is an edge-induced subgraph such that each of its edges belongs to at least triangles of . This notion has been introduced around ten years ago in social n…