bioRxiv · 10.1101/2020.04.01.018481
Succinct Dynamic de Bruijn Graphs
Abstract
MotivationThe de Bruijn graph is one of the fundamental data structures for analysis of high throughput sequencing data. In order to be applicable to population-scale studies, it is essential to build and store the graph in a space- and time-efficient manner. In addition, due to the ever-changing nature of population studies, it has become essential to update the graph after construction e.g. add and remove nodes and edges. Although there has been substantial effort on making the construction and storage of the graph efficient, there is a limited amount of work in building the graph in an efficient and mutable manner. Hence, most space efficient data structures require complete reconstruction of the graph in order to add or remove edges or nodes. ResultsIn this paper we present DynamicBOSS, a succinct representation of the de Bruijn graph that allows for an unlimited number of additions and deletions of nodes and edges. We compare our method with other competing methods and demonstrate that DynamicBOSS is the only method that supports both addition and deletion and is applicable to very large samples (e.g. greater than 15 billion k-mers). Competing dynamic methods e.g., FDBG (Crawford et al., 2018) cannot be constructed on large scale datasets, or cannot support both addition and deletion e.g., BiFrost (Holley and Melsted, 2019). AvailabilityDynamicBOSS is publicly available at https://github.com/baharpan/dynboss. Contactbaharpan@ufl.edu
Source connections
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Alipanahi, B., Kuhnle, A., Puglisi, S., Salmela, L., Boucher, C.. 2020-04-03. Succinct Dynamic de Bruijn Graphs. https://doi.org/10.1101/2020.04.01.018481
Cite the original work for its findings. Save a collection to share your selection of sources.