Maximal Common Subsequences (MCSs) between two strings X and Y are
subse...
Matching statistics were introduced to solve the approximate string matc...
Graph reductions are fundamental when dealing with large scale networks ...
A k-truss is an edge-induced subgraph H such that each of its edges
belo...
Zuckerli is a scalable compression system meant for large real-world gra...
This paper considers the subgraphs of an input graph that satisfy a give...
String data are often disseminated to support applications such as
locat...
The girth of a graph is the length of its shortest cycle. Due to its
rel...
Algorithms for listing the subgraphs satisfying a given property (e.g.,b...