Efficient construction of the BWT for repetitive text using string compression

Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space

(2020) Travis Gagie et al.   JOURNAL OF THE ACM

gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections

(2020) Felipe A. Louza et al.   Algorithms for Molecular Biology

Computing the multi-string BWT and LCP array in external memory

(2020) Paola Bonizzoni et al.   THEORETICAL COMPUTER SCIENCE

External memory BWT and LCP computation for sequence collections with applications

(2019) Lavinia Egidi et al.   Algorithms for Molecular Biology

Prefix-free parsing for building big BWTs

(2019) Christina Boucher et al.   Algorithms for Molecular Biology

Inducing enhanced suffix arrays for string collections

(2017) Felipe A. Louza et al.   THEORETICAL COMPUTER SCIENCE

Wheeler graphs: A framework for BWT-based data structures

(2017) Travis Gagie et al.   THEORETICAL COMPUTER SCIENCE

Big Data: Astronomical or Genomical?

(2015) Zachary D. Stephens et al.   PLOS BIOLOGY

Fast construction of FM-index for long sequence reads

(2014) H. Li   BIOINFORMATICS

Practical linear-timeO(1)-workspace suffix sorting for constant alphabets

(2013) Ge Nong   ACM TRANSACTIONS ON INFORMATION SYSTEMS

Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform

(2012) A. J. Cox et al.   BIOINFORMATICS

Lightweight algorithms for constructing and inverting the BWT of string collections

(2012) Markus J. Bauer et al.   THEORETICAL COMPUTER SCIENCE

Fast and accurate long-read alignment with Burrows–Wheeler transform

(2010) Heng Li et al.   BIOINFORMATICS

Ultrafast and memory-efficient alignment of short DNA sequences to the human genome

(2009) Ben Langmead et al.   GENOME BIOLOGY