Cdbgtricks: Strategies to update a compacted ...
Document type :
Communication dans un congrès avec actes
Title :
Cdbgtricks: Strategies to update a compacted de Bruijn graph
Author(s) :
Hannoush, Khodor [Auteur]
Scalable, Optimized and Parallel Algorithms for Genomics [GenScale]
Marchet, Camille [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Centre National de la Recherche Scientifique [CNRS]
Peterlongo, Pierre [Auteur]
Scalable, Optimized and Parallel Algorithms for Genomics [GenScale]
Scalable, Optimized and Parallel Algorithms for Genomics [GenScale]
Marchet, Camille [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Centre National de la Recherche Scientifique [CNRS]
Peterlongo, Pierre [Auteur]
Scalable, Optimized and Parallel Algorithms for Genomics [GenScale]
Conference title :
PSC 2024 - Prague Stringology Conference
Conference organizers(s) :
Faculty of Information Technology, Czech Technical University in Prague
City :
Prague (CZ)
Country :
République tchèque
Start date of the conference :
2024-08-26
Book title :
Prague Stringology Conference 2024
Publication date :
2024-08-24
HAL domain(s) :
Informatique [cs]/Bio-informatique [q-bio.QM]
English abstract : [en]
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 ...
Show more >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 .Show less >
Show more >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 .Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- document
- Open access
- Access the document
- 2024.05.24.khodor.full.pdf
- Open access
- Access the document