Abstract Gagie, Navarro and Prezza's r-index (SODA, 2018) promises to speed up DNA
alignment and variation calling by allowing us to index entire genomic databases, provided …

The string matching problem on a node-labeled graph G=(V, E) asks whether a given
pattern string P equals the concatenation of node labels of some path in G. This is a basic …

In the classic longest common substring (LCS) problem, we are given two strings $ S $ and
$ T $, each of length at most $ n $, over an alphabet of size $\sigma $, and we are asked to …

Cartesian tree matching is a recently introduced string matching problem in which two
strings match if their corresponding Cartesian trees are the same. It is considered …

Edit distance similarity search, also called approximate pattern matching, is a fundamental
problem with widespread database applications. The goal of the problem is to preprocess …

Abstract Nucleoside analogues like 4-thiouridine (4sU) are used to metabolically label
newly synthesized RNA. Chemical conversion of 4sU before sequencing induces T-to-C …

Data masking is a common technique for sanitizing sensitive data maintained in database
systems which is becoming increasingly important in various application areas, such as in …

In the Pattern Masking for Dictionary Matching (PMDM) problem, we are given a dictionary
$\mathcal {D} $ of $ d $ strings, each of length $\ell $, a query string $ q $ of length $\ell …

We investigate the limits of one of the fundamental ideas in data structures: fractional
cascading. This is an important data structure technique to speed up repeated searches for …