145 citations
- University of PalermoIT5 papers
- Bielefeld UniversityDE2 papers
- University of PisaIT2 papers
- Centrum Wiskunde & InformaticaNL1 paper
- Helsinki Institute for Information TechnologyFI1 paper
- Rutgers, The State University of New JerseyUS1 paper
- Universidade Federal de PernambucoBR1 paper
- University of HelsinkiFI1 paper
- Wellcome Sanger InstituteGB1 paper
4 papers · 1 filter
RLZAP: Relative Lempel-Ziv with Adaptive Pointers
Anthony J. Cox, Andrea Farruggia, Travis Gagie +2
Relative Lempel-Ziv (RLZ) is a popular algorithm for compressing databases of genomes from individuals of the same species when fast random access is desired. With Kuruppu et al.'s…
Lightweight LCP Construction for Very Large Collections of Strings
Anthony J. Cox, Fabio Garofalo, Giovanna Rosone +1
The longest common prefix array is a very advantageous data structure that, combined with the suffix array and the Burrows-Wheeler transform, allows to efficiently compute some com…
Lightweight LCP Construction for Next-Generation Sequencing Datasets
Markus J. Bauer, Anthony J. Cox, Giovanna Rosone +1
The advent of "next-generation" DNA sequencing (NGS) technologies has meant that collections of hundreds of millions of DNA sequences are now commonplace in bioinformatics. Knowing…
Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform
Anthony J. Cox, Markus J. Bauer, Tobias Jakobi +1
Motivation The Burrows-Wheeler transform (BWT) is the foundation of many algorithms for compression and indexing of text data, but the cost of computing the BWT of very large strin…