Exploiting parallelization in positional Burrows-Wheeler transform (PBWT) algorithms for efficient haplotype matching and compression.
Détails
Etat: Public
Version: Final published version
Licence: CC BY 4.0
ID Serval
serval:BIB_9B3CD4626BAA
Type
Article: article d'un périodique ou d'un magazine.
Collection
Publications
Institution
Titre
Exploiting parallelization in positional Burrows-Wheeler transform (PBWT) algorithms for efficient haplotype matching and compression.
Périodique
Bioinformatics advances
ISSN
2635-0041 (Electronic)
ISSN-L
2635-0041
Statut éditorial
Publié
Date de publication
03/2023
Peer-reviewed
Oui
Volume
3
Numéro
1
Pages
vbad021
Langue
anglais
Notes
Publication types: Journal Article
Publication Status: epublish
Publication Status: epublish
Résumé
The positional Burrows-Wheeler transform (PBWT) data structure allows for efficient haplotype data matching and compression. Its performance makes it a powerful tool for bioinformatics. However, existing algorithms do not exploit parallelism due to inner dependencies. We introduce a new method to break the dependencies and show how to fully exploit modern multi-core processors.
Source code and applications are available at https://github.com/rwk-unil/parallel_pbwt.
Supplementary data are available at Bioinformatics Advances online.
Source code and applications are available at https://github.com/rwk-unil/parallel_pbwt.
Supplementary data are available at Bioinformatics Advances online.
Pubmed
Open Access
Oui
Création de la notice
20/03/2023 11:52
Dernière modification de la notice
23/01/2024 8:31