Cdbgtricks: Strategies to update a compacted ...
Type de document :
Communication dans un congrès avec actes
Titre :
Cdbgtricks: Strategies to update a compacted de Bruijn graph
Auteur(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]
Titre de la manifestation scientifique :
PSC 2024 - Prague Stringology Conference
Organisateur(s) de la manifestation scientifique :
Faculty of Information Technology, Czech Technical University in Prague
Ville :
Prague (CZ)
Pays :
République tchèque
Date de début de la manifestation scientifique :
2024-08-26
Titre de l’ouvrage :
Prague Stringology Conference 2024
Date de publication :
2024-08-24
Discipline(s) HAL :
Informatique [cs]/Bio-informatique [q-bio.QM]
Résumé en anglais : [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 ...
Lire la suite >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 .Lire moins >
Lire la suite >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 .Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- document
- Accès libre
- Accéder au document
- 2024.05.24.khodor.full.pdf
- Accès libre
- Accéder au document