Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/340293
Type: Artigo
Title: External memory BWT and LCP computation for sequence collections with applications
Author: De Rossi, Tatiane
Granato, Daniela Campos
Ribeiro, Ana Carolina
Rivera, Cesar
Heberle, Henry
Telles, Guilherme Pimentel
Carnielli, Carolina Moretto
Brandao, Thais Bianca
Santos-Silva, Alan Roger
Lopes, Marcio Ajudarte
Paes Leme, Adriana Franco
Abstract: Sequencing technologies produce larger and larger collections of biosequences that have to be stored in compressed indices supporting fast search operations. Many compressed indices are based on the Burrows-Wheeler Transform (BWT) and the longest common prefix (LCP) array. Because of the sheer size of the input it is important to build these data structures in external memory and time using in the best possible way the available RAM.ResultsWe propose a space-efficient algorithm to compute the BWT and LCP array for a collection of sequences in the external or semi-external memory setting. Our algorithm splits the input collection into subcollections sufficiently small that it can compute their BWT in RAM using an optimal linear time algorithm. Next, it merges the partial BWTs in external or semi-external memory and in the process it also computes the LCP values. Our algorithm can be modified to output two additional arrays that, combined with the BWT and LCP array, provide simple, scan-based, external memory algorithms for three well known problems in bioinformatics: the computation of maximal repeats, the all pairs suffix-prefix overlaps, and the construction of succinct de Bruijn graphs.ConclusionsWe prove that our algorithm performs O(nmaxlcp) sequential I/Os, where n is the total length of the collection and maxlcp is the maximum LCP value. The experimental results show that our algorithm is only slightly slower than the state of the art for short sequences but it is up to 40 times faster for longer sequences or when the available RAM is at least equal to the size of the input.
Subject: Estruturas de dados (Computação)
Country: Reino Unido
Editor: Springer Nature
Rights: Aberto
Identifier DOI: 10.1186/s13015-019-0140-0
Address: https://almob.biomedcentral.com/articles/10.1186/s13015-019-0140-0
Date Issue: 2019
Appears in Collections:IC - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
000460728300002.pdf1.75 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.