skip to main content
Idioma:

Buffering updates enables efficient dynamic de Bruijn graphs

Alanko, Jarno ; Alipanahi, Bahar ; Settle, Jonathen ; Boucher, Christina ; Gagie, Travis

Computational and structural biotechnology journal, 2021-01, Vol.19, p.4067-4078 [Periódico revisado por pares]

Elsevier B.V

Texto completo disponível

Citações Citado por
  • Título:
    Buffering updates enables efficient dynamic de Bruijn graphs
  • Autor: Alanko, Jarno ; Alipanahi, Bahar ; Settle, Jonathen ; Boucher, Christina ; Gagie, Travis
  • Assuntos: Burrows-Wheeler transform ; de Bruijn graph ; Dynamic data structures ; Succinct data structures
  • É parte de: Computational and structural biotechnology journal, 2021-01, Vol.19, p.4067-4078
  • Notas: ObjectType-Article-1
    SourceType-Scholarly Journals-1
    ObjectType-Feature-2
    content type line 23
    These authors contributed equally.
  • Descrição: [Display omitted] The de Bruijn graph has become a ubiquitous graph model for biological data ever since its initial introduction in the late 1990s. It has been used for a variety of purposes including genome assembly (Zerbino and Birney, 2008; Bankevich et al., 2012; Peng et al., 2012), variant detection (Alipanahi et al., 2020b; Iqbal et al., 2012), and storage of assembled genomes (Chikhi et al., 2016). For this reason, there have been over a dozen methods for building and representing the de Bruijn graph and its variants in a space and time efficient manner. With the exception of a few data structures (Muggli et al., 2019; Holley and Melsted, 2020; Crawford et al.,2018), compressed and compact de Bruijn graphs do not allow for the graph to be efficiently updated, meaning that data can be added or deleted. The most recent compressed dynamic de Bruijn graph (Alipanahi et al., 2020a), relies on dynamic bit vectors which are slow in theory and practice. To address this shortcoming, we present a compressed dynamic de Bruijn graph that removes the necessity of dynamic bit vectors by buffering data that should be added or removed from the graph. We implement our method, which we refer to as BufBOSS, and compare its performance to Bifrost, DynamicBOSS, and FDBG. Our experiments demonstrate that BufBOSS achieves attractive trade-offs compared to other tools in terms of time, memory and disk, and has the best deletion performance by an order of magnitude.
  • Editor: Elsevier B.V
  • Idioma: Inglês
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.