Prefix-free parsing for building big BWTs
Abstract High-throughput sequencing technologies have led to explosive growth of genomic databases; one of which will soon reach hundreds of terabytes. For many applications we want to build and store indexes of these databases but constructing such indexes is a challenge. Fortunately, many of these...
Main Authors: | Christina Boucher, Travis Gagie, Alan Kuhnle, Ben Langmead, Giovanni Manzini, Taher Mun |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2019-05-01
|
Series: | Algorithms for Molecular Biology |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13015-019-0148-5 |
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) -
External memory BWT and LCP computation for sequence collections with applications
by: Lavinia Egidi, et al.
Published: (2019-03-01) -
Efficient and Robust Syslog Parsing for Network Devices in Datacenter Networks
by: Shenglin Zhang, et al.
Published: (2020-01-01) -
ANALISIS ALGORITMA MTF, MTF-1 DAN MTF-2 PADA BURROWS WHEELER COMPRESSION ALGORITHM
by: Sagara Mahardika Sunaryo, et al.
Published: (2019-07-01)