Name
Abstract | ||
|---|---|---|
The longest common prefix array is a very advantageous data structure that, combined with the suffix array and the Burrows–Wheeler transform, allows to efficiently compute some combinatorial properties of a string useful in several applications, especially in biological contexts. Nowadays, the input data for many problems are big collections of strings, for instance the data coming from “next-generation” DNA sequencing (NGS) technologies. In this paper we present the first lightweight algorithm (called extLCP) for the simultaneous computation of the longest common prefix array and the Burrows–Wheeler transform of a very large collection of strings having any length. The computation is realized by performing disk data accesses only via sequential scans, and the total disk space usage never needs more than twice the output size, excluding the disk space required for the input. Moreover, extLCP allows to compute also the suffix array of the strings of the collection, without any other further data structure is needed. Finally, we test our algorithm on real data and compare our results with another tool capable to work in external memory on large collections of strings. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.jda.2016.03.003 | Journal of Discrete Algorithms |
Keywords | DocType | Volume |
Longest common prefix array,Extended Burrows–Wheeler transform,Generalized suffix array | Journal | 37 |
Issue | ISSN | Citations |
C | 1570-8667 | 10 |
PageRank | References | Authors |
0.53 | 13 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anthony J Cox | 1 | 198 | 13.63 |
| Fabio Garofalo | 2 | 10 | 0.53 |
| Giovanna Rosone | 3 | 193 | 21.77 |
| Marinella Sciortino | 4 | 225 | 22.34 |