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

Full description

Bibliographic Details

Published in:	Journal of computational biology Vol. 26; no. 9; p. 948
Main Authors:	Bonizzoni, Paola, Della Vedova, Gianluca, Pirola, Yuri, Previtali, Marco, Rizzi, Raffaella
Format:	Journal Article
Language:	English
Published:	United States 01.09.2019
Subjects:	parallel algorithms Burrows–Wheeler transform multithreading longest common prefix array
ISSN:	1557-8666, 1557-8666
Online Access:	Get more information
Tags:	Add Tag No Tags, Be the first to tag this record!