Motivation Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) has caused
more than 14 million cases and more than half million deaths. Given the absence of …

An absent factor of a string w is a string u which does not occur as a contiguous substring
(aka factor) inside w. We extend this well-studied notion and define absent subsequences: a …

Minimal absent words (MAWs) are minimal-length oligomers absent from a genome or
proteome. Although some artificially synthesized MAWs have deleterious effects, there is still …

String matching is one of the oldest algorithmic techniques, yet still one of the most
pervasive in computer science. The past 20 years have seen technological leaps in …

A string w is called a minimal absent word (MAW) for a string S if w does not occur as a
substring in S and all proper substrings of w occur in S. MAWs are well-studied …

Given a string T of length n over an alphabet Σ⊂{1, 2,…, n O (1)} of size σ, we are to
preprocess T so that given a range [i, j], we can return a representation of a shortest string …

We consider the problem of maintaining the size of the LZ77 factorization of a string S of
length at most n under the following operations:(a) appending a given letter to S and (b) …

An absent factor of a string w is a string u which does not occur as a contiguous substring
(aka factor) inside w. We extend this well-studied notion and define absent subsequences: a …

A substring u of a string T is called a minimal unique substring (MUS) of T if u occurs exactly
once in T and any proper substring of u occurs at least twice in T. In this paper, we study the …

The palindromic tree (aka eertree) for a string S of length n is a tree-like data structure that
represents the set of all distinct palindromic substrings of S, using O (n) space [Rubinchik …