Um algoritmo para a construção de vetores de sufixo generalizados em memória externa

Louza, Felipe A.

doi:10.11606/d.55.2013.tde-26032014-100626

Cited by 1 publication

(1 citation statement)

References 60 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For large collections eGSA works in two phases [17,16]. In the first phase, the collection S is partitioned into different subsets of equal dimension and each subset is treated as a single string, that is the concatenation of the strings of the subset.…”

Section: Computational Experiments and Discussionmentioning

confidence: 99%

Lightweight LCP construction for very large collections of strings

Cox

Garofalo

Rosone

et al. 2016

Journal of Discrete Algorithms

View full text Add to dashboard Cite

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

show abstract

Section: Computational Experiments and Discussionmentioning

confidence: 99%