research
∙
07/25/2023
A Compact DAG for Storing and Searching Maximal Common Subsequences
Maximal Common Subsequences (MCSs) between two strings X and Y are subse...
share
research
∙
01/13/2023
Computing matching statistics on Wheeler DFAs
Matching statistics were introduced to solve the approximate string matc...
research
∙
08/06/2022
Graph Pooling with Maximum-Weight k-Independent Sets
Graph reductions are fundamental when dealing with large scale networks ...
research
∙
10/02/2020
Efficient Estimation of Graph Trussness
A k-truss is an edge-induced subgraph H such that each of its edges belo...
research
∙
09/02/2020
Zuckerli: A New Compressed Representation for Graphs
Zuckerli is a scalable compression system meant for large real-world gra...
research
∙
12/31/2019
Proximity Search For Maximal Subgraph Enumeration
This paper considers the subgraphs of an input graph that satisfy a give...
research
∙
06/26/2019
String Sanitization: A Combinatorial Approach
String data are often disseminated to support applications such as locat...
research
∙
06/12/2018
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
The girth of a graph is the length of its shortest cycle. Due to its rel...
research
∙
03/09/2018
