The wavelet tree is a versatile data structure that serves a number of purposes, from string
processing to computational geometry. It can be regarded as a device that represents a …

Approximate nearest neighbor search for vectors relies on indexes that are most often
accessed from RAM. Therefore, storage is the factor limiting the size of the database that can …

A wavelet forest for a text T [1.. n] over an alphabet σ takes n H 0 (T)+ o (n log σ) bits of space
and supports access and rank on T in O (log σ) time. Kärkkäinen and Puglisi (2011) implicitly …

Most of the attention in statistical compression is given to the space used by the compressed
sequence, a problem completely solved with optimal prefix codes. However, in many …

In this paper, we discuss an efficient and effective index mechanism to do the string
matching with k mismatches, by which we will find all the substrings in a target string s …

Large-alphabet strings are common in scenarios such as information retrieval and natural-
language processing. The efficient storage and processing of such strings usually …

The amount of stored data has increased exponentially over the past few decades, and it
seems this tendency will last. Databases are being flooded with tons of data, coming from …

In this work, we present a literature review for full-text and keyword indexes as well as our
contributions (which are mostly practice-oriented). The first contribution is the FM-bloated …

Genomic regions determining sexual compatibility often display recombination suppression,
as occurs in sex chromosomes, plant self-incompatibility loci and fungal mating-type loci …

AQ1: Please check all author names and affiliations. Please check that author surnames
have been identified by a pink background in the PDF version, and by green text in the html …