z-logo
open-access-imgOpen Access
Code optimization of multiple sequence alignment software tool MSA_BG on GPU-accelerated computing infrastructures
Author(s) -
Plаmеnkа Borovskа,
Maria Marinova,
Vasil Tsanov
Publication year - 2019
Publication title -
aip conference proceedings
Language(s) - English
Resource type - Conference proceedings
SCImago Journal Rank - 0.177
H-Index - 75
eISSN - 1551-7616
pISSN - 0094-243X
DOI - 10.1063/1.5133488
Subject(s) - massively parallel , computer science , scalability , parallel computing , software , big data , supercomputer , multiple sequence alignment , code (set theory) , sequence (biology) , smith–waterman algorithm , distributed computing , computational science , sequence alignment , data mining , programming language , database , set (abstract data type) , chemistry , biochemistry , genetics , biology , gene , peptide sequence
Multiple biological sequences alignment is one of the fundamental tasks in computational biology. The problem is NP-hard and has been subjected to intense research during the last 10 years. Exact MSA algorithms such as Clustawl have considerable serial sections (for building up the guide tree) which limit the efficiency of code parallelization and optimization. In the era of Big data, the Big genomic data ecosystem has accumulated huge amounts of genomic data provoking the challenge for innovative massively parallel algorithmic paradigms targeted for the efficient exploitation of the abandon parallel hardware resources within the high performance computing infrastructure. The goal of our investigation is to design and implement software tool for massively parallel multiple sequence alignment based on our randomized method for massively parallel multiple sequence alignment targeted for GPU accelerated computing infrastructures. Parallel performance evaluation analysis shows efficient scalability in respect to data size and machine size.Multiple biological sequences alignment is one of the fundamental tasks in computational biology. The problem is NP-hard and has been subjected to intense research during the last 10 years. Exact MSA algorithms such as Clustawl have considerable serial sections (for building up the guide tree) which limit the efficiency of code parallelization and optimization. In the era of Big data, the Big genomic data ecosystem has accumulated huge amounts of genomic data provoking the challenge for innovative massively parallel algorithmic paradigms targeted for the efficient exploitation of the abandon parallel hardware resources within the high performance computing infrastructure. The goal of our investigation is to design and implement software tool for massively parallel multiple sequence alignment based on our randomized method for massively parallel multiple sequence alignment targeted for GPU accelerated computing infrastructures. Parallel performance evaluation analysis shows efficient scalability in respect...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom