Name
Abstract | ||
|---|---|---|
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 several algorithms on a collection of strings, such as those for genome assembly. In this article, we explore a multithread computational strategy for building the BWT and LCP array. Our algorithm applies a divide and conquer approach that leads to parallel computation of multistring BWT and LCP array. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1089/cmb.2018.0230 | JOURNAL OF COMPUTATIONAL BIOLOGY |
Keywords | Field | DocType |
Burrows-Wheeler transform,longest common prefix array,multithreading,parallel algorithms | LCP array,Multithreading,Burrows–Wheeler transform,Parallel algorithm,Generalization,Parallel computing,Search engine indexing,Artificial intelligence,Machine learning,Mathematics | Journal |
Volume | Issue | ISSN |
26.0 | SP9 | 1066-5277 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paola Bonizzoni | 1 | 502 | 52.23 |
| Gianluca Della Vedova | 2 | 342 | 36.39 |
| Yuri Pirola | 3 | 128 | 15.79 |
| Marco Previtali | 4 | 22 | 5.45 |
| Raffaella Rizzi | 5 | 130 | 13.58 |