19 citations · 51 across the 20 of their papers we have counts for
25 papers
Variations on the Problem of Identifying Spectrum-Preserving String Sets
Sankardeep Chakraborty, Roberto Grossi, Ren Kimura +3
In computational genomics, many analyses rely on efficient storage and traversal of -mers, motivating compact representations such as spectrum-preserving string sets (SPSS), whi…
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…
One Hundred Years Later: Stern-Gerlach Experiment and Dimension Witnesses
R. Grossi, Lucas L. Brugger, B. F. Rizzuti +1
Inspired by the one-hundredth anniversary of the seminal works of Stern and Gerlach, our contribution is a proposal of how to use their famous experiment in a more contemporary per…
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…
Zuckerli: A New Compressed Representation for Graphs
Luca Versari, Iulia M. Comsa, Alessio Conte +1
Zuckerli is a scalable compression system meant for large real-world graphs. Graphs are notoriously challenging structures to store efficiently due to their linked nature, which ma…
Proximity Search For Maximal Subgraph Enumeration
Alessio Conte, Andrea Marino, Roberto Grossi +2
This paper proposes a new general technique for maximal subgraph enumeration which we call proximity search, whose aim is to design efficient enumeration algorithms for problems th…