Divide and Conquer Computation of the Multi-string BWT and LCP Array

Paola Bonizzoni,Gianluca Della Vedova,Serena Nicosia,Yuri Pirola,Raffaella Rizzi,Marco Previtali

doi:10.1007/978-3-319-94418-0_11

Divide and Conquer Computation of the Multi-string BWT and LCP Array

Paola Bonizzoni, Gianluca Della Vedova + Show 4 more

https://doi.org/10.1007/978-3-319-94418-0_11

Copy DOI

Publication Date: Jan 1, 2018

Citations: 7

Affiliation: University of Milano-Bicocca

#Longest Common Prefix Array #Longest Common Prefix + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

Indexing huge collections of strings, such as those produced by the widespread sequencing technologies, heavily relies on multi-string generalizations of the Burrows-Wheeler Transform (BWT) and the Longest Common Prefix (LCP) array, since solving efficiently both problems are essential ingredients of several algorithms on a collection of strings.

Full Text