Strategies to update a compacted de Bruijn graph

<div> We propose Cdbgtricks, a new method for updating a compacted de Bruijn graph when addingnovel sequences, such as full genomes. Our method indexes the graph, enabling to identify in constanttime the location (unitig and offset) of any k-mer. The update operation that we propose also updatesthe index. Our results show that Cdbgtricks is faster than Bifrost and GGCAT. We benefit from theindex of the graph to provide new functionalities, such as reporting the subgraph that share a desiredpercentage of k-mers with a query sequence with the ability to query a set of reads. The open-sourceCdbgtricks software is available at https://github.com/khodor14/Cdbgtricks. </div>