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

Descripció completa

Dades bibliogràfiques

Autors principals:	Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles
Format:	Artigo
Idioma:	Inglês
Publicat:	BMC 2019-03-01
Col·lecció:	Algorithms for Molecular Biology
Matèries:	Burrows–Wheeler Transform Longest common prefix array Maximal repeats All pairs suffix–prefix overlaps Succinct de Bruijn graph External memory algorithms
Accés en línia:	http://link.springer.com/article/10.1186/s13015-019-0140-0
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!