| Texto completo | |
| Autor(es): |
Egidi, Lavinia
;
Louza, Felipe A.
;
Manzini, Giovanni
;
Telles, Guilherme P.
Número total de Autores: 4
|
| Tipo de documento: | Artigo Científico |
| Fonte: | 18TH INTERNATIONAL WORKSHOP ON ALGORITHMS IN BIOINFORMATICS, WABI 2018; v. 113, p. 14-pg., 2018-01-01. |
| Resumo | |
We propose an external memory algorithm for the computation of the BWT and LCP array for a collection of sequences. Our algorithm takes the amount of available memory as an input parameter, and tries to make the best use of it by splitting 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 memory and in the process it also computes the LCP values. We show that our algorithm performs O( n maxlcp) 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 outperforms the current best algorithm for collections of sequences with different lengths and when the average LCP of the collection is relatively small compared to the length of the sequences. In the second part of the paper, we show that our algorithm can be modified to output two additional arrays that, combined with the BWT and LCP arrays, provide simple, scan based, external memory algorithms for three well known problems in bioinformatics: the computation of the all pairs suffix-prefix overlaps, the computation of maximal repeats, and the construction of succinct de Bruijn graphs. (AU) | |
| Processo FAPESP: | 17/09105-0 - Ordenação de sufixos e medidas de similaridade entre cadeias |
| Beneficiário: | Felipe Alves da Louza |
| Modalidade de apoio: | Bolsas no Brasil - Pós-Doutorado |