| Texto completo | |
| Autor(es): |
Egidi, Lavinia
;
Louza, Felipe A.
;
Manzini, Giovanni
Número total de Autores: 3
|
| Tipo de documento: | Artigo Científico |
| Fonte: | STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2019; v. 11811, p. 15-pg., 2019-01-01. |
| Resumo | |
We propose a new algorithm for merging succinct representations of de Bruijn graphs introduced in [Bowe et al. WABI 2012]. Our algorithm is based on the lightweight BWT merging approach by Holt and McMillan [Bionformatics 2014, ACM-BCB 2014]. Our algorithm has the same asymptotic cost of the state of the art tool for the same problem presented by Muggli et al. [bioRxiv 2017, Bioinformatics 2019], but it uses less than half of its working space. A novel important feature of our algorithm, not found in any of the existing tools, is that it can compute the Variable Order succinct representation of the union graph within the same asymptotic time/space bounds. (AU) | |
| Processo FAPESP: | 18/21509-2 - Transformada de Burrows-Wheeler e grafos De Bruijn sucintos |
| Beneficiário: | Felipe Alves da Louza |
| Modalidade de apoio: | Bolsas no Exterior - Estágio de Pesquisa - Pós-Doutorado |
| 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 |