Fast construction of FM-index for long sequence reads

Abstract

Summary: We present a new method to incrementally construct the FM-index for both short and long sequence reads, up to the size of a genome. It is the first algorithm that can build the index while implicitly sorting the sequences in the reverse (complement) lexicographical order without a separate sorting step. The implementation is among the fastest for indexing short reads and the only one that practically works for reads of averaged kilobases in length. Availability and implementation: https://github.com/lh3/ropebwt2 Contact: [email protected]

2 pages

Cited by in corpus (4)

• A massively parallel algorithm for constructing the BWT of large string sets
• From H&M to Gap for Lightweight BWT Merging
• A New Lightweight Algorithm to compute the BWT and the LCP array of a Set of Strings
• FermiKit: assembly-based variant calling for Illumina resequencing data