Abstract The Lempel-Ziv (LZ77) factorization of a string is a widely-used algorithmic tool that
plays a central role in data compression and indexing. For a length-n string over integer …

Genome assembly databases are growing rapidly. The redundancy of sequence content
between a new assembly and previous ones is neither conceptually nor algorithmically easy …

FM-indexes are crucial data structures in DNA alignment, but searching with them usually
takes at least one random access per character in the query pattern. Ferragina and Fischer …

Lempel-Ziv (LZ77) factorization is a fundamental problem in string processing: Greedily
partition a given string T from left to right into blocks (called phrases) so that each phrase is …

Stringology is a subfield of computer science dedicated to analyzing and processing
sequences of symbols. It plays a crucial role in various applications, including lossless …

We present novel online approximations of the Lempel-Ziv 77 (LZ77) and Lempel-Ziv 78
(LZ78) compression schemes [Lempel & Ziv, 1977/1978] with parameterizable space usage …

Prefix free parsing [Boucher et al., Alg. Mol. Biol., 2019], is a highly effective heuristic for
computing text indexes for very large amounts of biological data. The algorithm constructs a …

The burgeoning volume of genomic data, fueled by advances in sequencing technologies,
demands efficient data compression solutions. Traditional algorithms like Lempel-Ziv77 …

With DNA sequencing becoming a routine analysis, the amount of genomic data collected is
growing rapidly, having already reached the pace, only destined to grow, of more than 35 …

Background Medical schools are called to be socially accountable as a feature of excellent
medical education. Medical students are essential to the development of socially …