Maximal Common Subsequences (MCSs) between two strings X and Y are
subse...
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...
Deterministic finite automata are one of the simplest and most practical...
String data are often disseminated to support applications such as
locat...
Exact pattern matching in labeled graphs is the problem of searching pat...
Exact pattern matching in labeled graphs is the problem of searching pat...
In this paper we introduce a new family of string processing problems. W...
We consider the communication complexity of fundamental longest common p...
This paper proposes round-hashing, which is suitable for data storage on...
Algorithms for listing the subgraphs satisfying a given property (e.g.,b...