External memory BWT and LCP computation for sequence collections with applications
Abstract Background Sequencing technologies produce larger and larger collections of biosequences that have to be stored in compressed indices supporting fast search operations. Many compressed indices are based on the Burrows–Wheeler Transform (BWT) and the longest common prefix (LCP) array. Becaus...
Main Authors: | Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2019-03-01
|
Series: | Algorithms for Molecular Biology |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13015-019-0140-0 |
Similar Items
-
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections
by: Felipe A. Louza, et al.
Published: (2020-09-01) -
Buffering updates enables efficient dynamic de Bruijn graphs
by: Jarno Alanko, et al.
Published: (2021-01-01) -
Generalized enhanced suffix array construction in external memory
by: Felipe A. Louza, et al.
Published: (2017-12-01) -
Prefix-free parsing for building big BWTs
by: Christina Boucher, et al.
Published: (2019-05-01) -
The Transcription of the -ic, -ical, and ics Suffixes in the Indonesia Language
by: Zaenal Arifin Toy
Published: (2018-01-01)