Multithread Multistring Burrows-Wheeler Transform and Longest Common Prefix Array

Indexing huge collections of strings, such as those produced by the widespread sequencing technologies, heavily relies on multistring generalizations of the Burrows-Wheeler transform (BWT) and the longest common prefix (LCP) array, since solving efficiently both problems are essential ingredients of...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computational biology Ročník 26; číslo 9; s. 948
Hlavní autori:	Bonizzoni, Paola, Della Vedova, Gianluca, Pirola, Yuri, Previtali, Marco, Rizzi, Raffaella
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States 01.09.2019
Predmet:	parallel algorithms Burrows–Wheeler transform multithreading longest common prefix array
ISSN:	1557-8666, 1557-8666
On-line prístup:	Zistit podrobnosti o prístupe
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!