📖
Cdbgtricks: Strategies to update a compacted de Bruijn graph
Khodor Hannoush, Camille Marchet, Pierre Peterlongo

Cdbgtricks: Strategies to update a compacted de Bruijn graph

Science & Mathematics Published 2024 Verification Pending

Overview & Synopsis

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

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Cdbgtricks: Strategies to update a compacted de Bruijn graph
Author / Organization Khodor Hannoush, Camille Marchet, Pierre Peterlongo
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2024
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-111885
Original Source Link Visit Source Page on hal.science »