pith. sign in

arxiv: 1406.0426 · v1 · pith:LOYFKA5Xnew · submitted 2014-06-02 · 🧬 q-bio.GN · cs.DS

Fast construction of FM-index for long sequence reads

classification 🧬 q-bio.GN cs.DS
keywords readsfm-indeximplementationlongsequenceshortsortingalgorithm
0
0 comments X
read the original 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: hengli@broadinstitute.org

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.