Pasar al contenido principal

Optimization of HPC bioinformatic tools using hardware accelerators on heterogeneous architectures

IJC2020-045916-I

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de Promoción del Talento y su Empleabilidad en I+D+i
Subprograma Subprograma Estatal de Incorporación
Convocatoria Juan de la Cierva Incorporación
Año convocatoria 2020
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario BARCELONA SUPERCOMPUTING CENTER CENTRO NACIONAL DE SUPERCOMPUTACION

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
Encontrada(s) 1 página(s)

Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

WFA-GPU: Gap-affine pairwise read-alignment using GPUs

  • Aguado-Puig, Quim|||0000-0003-4871-3192
  • Doblas, Max
  • Matzoros, Christos
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Moure, Juan C.|||0000-0001-6697-0331
  • Marco-Sola, Santiago|||0000-0001-7951-3914
  • Moreto, Miquel|||0000-0002-9848-8758
Advances in genomics and sequencing technologies demand faster and more scalable analysis methods that can process longer sequences with higher accuracy. However, classical pairwise alignment methods, based on dynamic programming (DP), impose impractical computational requirements to align long and noisy sequences like those produced by PacBio and Nanopore technologies. The recently proposed wavefront alignment (WFA) algorithm paves the way for more efficient alignment tools, improving time and memory complexity over previous methods. However, high-performance computing (HPC) platforms require efficient parallel algorithms and tools to exploit the computing resources available on modern accelerator-based architectures. This paper presents WFA-GPU, a GPU (graphics processing unit)-accelerated tool to compute exact gap-affine alignments based on the WFA algorithm. We present the algorithmic adaptations and performance optimizations that allow exploiting the massively parallel capabilities of modern GPU devices to accelerate the alignment computations. In particular, we propose a CPU-GPU co-design capable of performing inter-sequence and intra-sequence parallel sequence alignment, combining a succinct WFA-data representation with an efficient GPU implementation. As a result, we demonstrate that our implementation outperforms the original multi-threaded WFA implementation by up to 4.3× and up to 18.2× when using heuristic methods on long and noisy sequences. Compared to other state-of-the-art tools and libraries, the WFA-GPU is up to 29× faster than other GPU implementations and up to four orders of magnitude faster than other CPU implementations. Furthermore, WFA-GPU is the only GPU solution capable of correctly aligning long reads using a commodity GPU. WFA-GPU code and documentation are publicly available at https://github.com/quim0/WFA-GPU.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Optimal gap-affine alignment in O (s) space

  • Marco-Sola, Santiago|||0000-0001-7951-3914
  • Eizenga, Jordan|||0000-0001-8345-8356
  • Guarracino, Andrea|||0000-0001-9744-131X
  • Paten, Benedict|||0000-0001-8863-3539
  • Garrison, Erik|||0000-0003-3821-631X
  • Moreto, Miquel|||0000-0002-9848-8758
Pairwise sequence alignment remains a fundamental problem in computational biology and bioinformatics. Recent advances in genomics and sequencing technologies demand faster and scalable algorithms that can cope with the ever-increasing sequence lengths. Classical pairwise alignment algorithms based on dynamic programming are strongly limited by quadratic requirements in time and memory. The recently proposed wavefront alignment algorithm (WFA) introduced an efficient algorithm to perform exact gap-affine alignment in time, where s is the optimal score and n is the sequence length. Notwithstanding these bounds, WFA's memory requirements become computationally impractical for genome-scale alignments, leading to a need for further improvement. In this article, we present the bidirectional WFA algorithm, the first gap-affine algorithm capable of computing optimal alignments in memory while retaining WFA's time complexity of . As a result, this work improves the lowest known memory bound to compute gap-affine alignments. In practice, our implementation never requires more than a few hundred MBs aligning noisy Oxford Nanopore Technologies reads up to 1 Mbp long while maintaining competitive execution times. All code is publicly available at . Supplementary data are available at Bioinformatics online.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A draft human pangenome reference

  • Liao, Wen-Wei|||0000-0001-8183-213X
  • Asri, Mobin
  • Ebler, Jana
  • Doerr, Daniel|||0000-0002-3720-6227
  • Haukness, Marina|||0000-0001-9991-8089
  • Hickey, Glenn
  • Lu, Shuangjia|||0000-0001-8571-6902
  • Lucas, Julian K.
  • Monlong, Jean
  • Abel, Haley J.
  • Buonaiuto, Silvia
  • Chang, Xian H.
  • Cheng, Haoyu|||0000-0002-9209-5793
  • Chu, Justin
  • Colonna, Vincenza|||0000-0002-3966-0474
  • Eizenga, Jordan|||0000-0001-8345-8356
  • Feng, Xiaowen
  • Fischer, Christian
  • Fulton, Robert S.
  • Garg, Shilpa
  • Groza, Cristian
  • Guarracino, Andrea|||0000-0001-9744-131X
  • Harvey, William T.
  • Heumos, Simon
  • Howe, Kerstin|||0000-0003-2237-513X
  • Jain, Miten|||0000-0002-4571-3982
  • Lu, Tsung-Yu|||0000-0001-7110-3937
  • Markello, Charles
  • Martin, Fergal J.|||0000-0002-1672-050X
  • Mitchell, Matthew W.|||0000-0002-6947-0495
  • Munson, Katherine M.|||0000-0001-8413-6498
  • Mwaniki, Moses Njagi
  • Novak, Adam M.|||0000-0001-5828-047X
  • Olsen, Hugh E.
  • Pesout, Trevor
  • Porubsky, David|||0000-0001-8414-8966
  • Prins, Pjotr|||0000-0002-8021-9162
  • Sibbesen, Jonas A.
  • Sirén, Jouni|||0000-0001-5828-4139
  • Tomlinson, Chad|||0000-0001-9905-6159
  • Villani, Flavia|||0000-0003-3633-0610
  • Vollger, Mitchell R.|||0000-0002-8651-1615
  • Antonacci-Fulton, Lucinda L.
  • Baid, Gunjan
  • Baker, Carl A.
  • Belyaeva, Anastasiya
  • Billis, Konstantinos|||0000-0001-8568-4306
  • Carroll, Andrew
  • Chang, Pi-Chuan
  • Cody, Sarah
  • Cook, Daniel E.
  • Cook-Deegan, Robert M.
  • Cornejo, Omar E.|||0000-0003-4076-4227
  • Diekhans, Mark|||0000-0002-0430-0989
  • Ebert, Peter|||0000-0001-7441-532X
  • Fairley, Susan
  • Fedrigo, Olivier|||0000-0002-6450-7551
  • Felsenfeld, Adam L.
  • Formenti, Giulio|||0000-0002-7554-5991
  • Frankish, Adam|||0000-0002-4333-628X
  • Gao, Yan
  • Garrison, Nanibaa' A.|||0000-0002-6228-3216
  • Giron, Carlos Garcia
  • Green, Richard E.|||0000-0003-0516-5827
  • Haggerty, Leanne
  • Hoekzema, Kendra
  • Hourlier, Thibaut|||0000-0003-4894-7773
  • Ji, Hanlee P.|||0000-0003-3772-3424
  • Kenny, Eimear E.
  • Koenig, Barbara A.
  • Kolesnikov, Alexey
  • Korbel, Jan O.|||0000-0002-2798-3794
  • Kordosky, Jennifer
  • Koren, Sergey|||0000-0002-1472-8962
  • Lee, HoJoon|||0000-0002-0973-9544
  • Lewis, Alexandra P.
  • Magalhães, Hugo|||0000-0002-6807-1548
  • Marco-Sola, Santiago|||0000-0001-7951-3914
  • Marijon, Pierre
  • McCartney, Ann
  • McDaniel, Jennifer|||0000-0003-1987-0914
  • Mountcastle, Jacquelyn|||0000-0003-1078-4905
  • Nattestad, Maria
  • Nurk, Sergey
  • Olson, Nathan D.|||0000-0003-2585-3037
  • Popejoy, Alice B.
  • Puiu, Daniela
  • Rautiainen, Mikko
  • Regier, Allison A.
  • Rhie, Arang|||0000-0002-9809-8127
  • Sacco, Samuel
  • Sanders, Ashley D.
  • Schneider, Valerie A.
  • Schultz, Baergen I.
  • Shafin, Kishwar|||0000-0001-5252-3434
  • Smith, Michael W.
  • Sofia, Heidi J.
  • Abou Tayoun, Ahmad
  • Thibaud-Nissen, Françoise|||0000-0003-4957-7807
  • Tricomi, Francesca Floriana|||0000-0002-6170-5499
  • Wagner, Justin
  • Walenz, Brian|||0000-0001-8431-1428
  • Wood, Jonathan|||0000-0002-7545-2162
  • Zimin, Aleksey V.
  • Bourque, Guillaume|||0000-0002-3933-9656
  • Chaisson, Mark|||0000-0001-5395-1457
  • Flicek, Paul|||0000-0002-3897-7955
  • Phillippy, Adam M.|||0000-0003-2983-8934
  • Zook, Justin M.|||0000-0003-2309-8402
  • Eichler, Evan E.|||0000-0002-8246-4014
  • Haussler, David
  • Wang, Ting|||0000-0002-6800-242X
  • Jarvis, Erich|||0000-0001-8931-5049
  • Miga, Karen H.|||0000-0002-3670-4507
  • Garrison, Erik|||0000-0003-3821-631X
  • Marschall, Tobias|||0000-0002-9376-1030
  • Hall, Ira M.|||0000-0003-4442-6655
  • Li, Heng|||0000-0003-4874-2874
  • Paten, Benedict|||0000-0001-8863-3539
Here the Human Pangenome Reference Consortium presents a first draft of the human pangenome reference. The pangenome contains 47 phased, diploid assemblies from a cohort of genetically diverse individuals1. These assemblies cover more than 99% of the expected sequence in each genome and are more than 99% accurate at the structural and base pair levels. Based on alignments of the assemblies, we generate a draft pangenome that captures known variants and haplotypes and reveals new alleles at structurally complex loci. We also add 119 million base pairs of euchromatic polymorphic sequences and 1,115 gene duplications relative to the existing reference GRCh38. Roughly 90 million of the additional base pairs are derived from structural variation. Using our draft pangenome to analyse short-read data reduced small variant discovery errors by 34% and increased the number of structural variants detected per haplotype by 104% compared with GRCh38-based workflows, which enabled the typing of the vast majority of structural variant alleles per sample.