research
∙
04/17/2023
Lossy Compressor preserving variant calling through Extended BWT
A standard format used for storing the output of high-throughput sequenc...
share
research
∙
08/11/2021
Practical evaluation of Lyndon factors via alphabet reordering
We evaluate the influence of different alphabet orderings on the Lyndon ...
research
∙
12/14/2020
A New Approach to Regular Indeterminate Strings
In this paper we propose a new, more appropriate definition of regular a...
research
∙
11/25/2020
Grammar Compression By Induced Suffix Sorting
A grammar compression algorithm, called GCIS, is introduced in this work...
research
∙
09/05/2020
Space efficient merging of de Bruijn graphs and Wheeler graphs
The merging of succinct data structures is a well established technique ...
research
∙
05/30/2019
Inducing the Lyndon Array
In this paper we propose a variant of the induced suffix sorting algorit...
research
∙
03/25/2019
Algorithms to compute the Burrows-Wheeler Similarity Distribution
The Burrows-Wheeler transform (BWT) is a well studied text transformatio...
research
∙
02/07/2019
Space-efficient merging of succinct de Bruijn graphs
We propose a new algorithm for merging succinct representations of de Br...
research
∙
12/21/2018
A Simple Algorithm for Computing the Document Array
We present a simple algorithm for computing the document array given the...
research
∙
05/17/2018
External memory BWT and LCP computation for sequence collections with applications
We propose an external memory algorithm for the computation of the BWT a...
research
∙
11/08/2017
A Grammar Compression Algorithm based on Induced Suffix Sorting
We introduce GCIS, a grammar compression algorithm based on the induced ...
research
∙
10/27/2017