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 …

The decrease in sequencing expenses has facilitated the creation of reference genomes
and proteomes for an expanding array of organisms. Nevertheless, no established …

According to studies carried out, approximately 10 million people developed tuberculosis in
2018. Of this total, 1.5 million people died from the disease. To study the behavior of the …

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 …

Privacy issues limit the analysis and cross-exploration of most distributed and private
biobanks, often raised by the multiple dimensionality and sensitivity of the data associated …

We introduce the notion of reverse-safe data structures. These are data structures that
prevent the reconstruction of the data they encode (ie, they cannot be easily reversed). A …

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

A string w is called a minimal absent word (MAW) for another string T if w does not occur in T
but the proper substrings of w occur in T. For example, let Σ={a, b, c} be the alphabet. Then …