Výsledky vyhľadávania - Burrows–Wheeler transform longest common prefix array multithreading parallel algorithms

Multithread Multistring Burrows-Wheeler Transform and Longest Common Prefix Array Autor Bonizzoni, Paola, Della Vedova, Gianluca, Pirola, Yuri, Previtali, Marco, Rizzi, Raffaella

“…) and the longest common prefix (LCP) array, since solving efficiently both problems are essential ingredients of several algorithms on a collection of strings, such as those for genome assembly…”
Zistit podrobnosti o prístupe

Computing the longest common prefix array based on the Burrows–Wheeler transform Autor Beller, Timo, Gog, Simon, Ohlebusch, Enno, Schnattinger, Thomas

“… In this paper, we present the first algorithm that computes the longest common prefix array directly on the wavelet tree of the Burrows…”
Získať plný text