Strategies to update a compacted de Bruijn graph
Type de document :
Communication dans un congrès avec actes
Titre :
Strategies to update a compacted de Bruijn graph
Auteur(s) :
Hannoush, Khodor [Auteur correspondant]
Scalable, Optimized and Parallel Algorithms for Genomics [GenScale]
Marchet, Camille [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
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]
Peterlongo, Pierre [Auteur]
Scalable, Optimized and Parallel Algorithms for Genomics [GenScale]
Titre de la manifestation scientifique :
SeqBIM 2024 - Journées annuelles du groupe de travail SeqBIM (Séquences en Bioinformatique, Informatique et Mathématiques)
Ville :
Rennes
Pays :
France
Date de début de la manifestation scientifique :
2024-11-28
Titre de l’ouvrage :
SeqBIM 2024
Date de publication :
2024-11-19
Discipline(s) HAL :
Informatique [cs]/Bio-informatique [q-bio.QM]
Informatique [cs]/Algorithme et structure de données [cs.DS]
Informatique [cs]/Algorithme et structure de données [cs.DS]
Résumé en anglais : [en]
<div><p>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 ...
Lire la suite ><div><p>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.</p></div>Lire moins >
Lire la suite ><div><p>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.</p></div>Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- document
- Accès libre
- Accéder au document
- seqbim2024_Khodor_Hannoush.pdf
- Accès libre
- Accéder au document