Burrows-wheeler transform and lcp array construction in constant space
Felipe A. Louza, Travis Gagie, Guilherme P. Telles
ARTIGO
Inglês
In this article we extend the elegant in-place Burrows-Wheeler transform (BWT) algorithm proposed by Crochemore et al. [12]. Our extension is twofold: we first show how to compute simultaneously the longest common prefix (LCP) array as well as the BWT, us
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - CNPQ
162338/2015-5
COORDENAÇÃO DE APERFEIÇOAMENTO DE PESSOAL DE NÍVEL SUPERIOR - CAPES
fechado
Burrows-wheeler transform and lcp array construction in constant space
Felipe A. Louza, Travis Gagie, Guilherme P. Telles
Burrows-wheeler transform and lcp array construction in constant space
Felipe A. Louza, Travis Gagie, Guilherme P. Telles
Fontes
|
Journal of discrete algorithms (Fonte avulsa) |