External memory BWT and LCP computation for sequence collections with applications

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...

Full description

Bibliographic Details
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:
Burrows–Wheeler Transform
Longest common prefix array
Maximal repeats
All pairs suffix–prefix overlaps
Succinct de Bruijn graph
External memory algorithms
Online Access:http://link.springer.com/article/10.1186/s13015-019-0140-0

Internet

http://link.springer.com/article/10.1186/s13015-019-0140-0

Similar Items