Elói Araújo, M. A. Stefanes, Valter de O. Ferlete, L. Rozante
{"title":"Multiple Sequence Alignment using Hybrid Parallel Computing","authors":"Elói Araújo, M. A. Stefanes, Valter de O. Ferlete, L. Rozante","doi":"10.1109/BIBE.2017.00-59","DOIUrl":null,"url":null,"abstract":"Multiple sequence alignment (MSA) is critical in several areas of science, especially in bioinformatics. Expressive advances have been developed in MSA and many methods, algorithms and tools have been proposed for it. Since the MSA is an NP-hard problem, efforts have led to the emergence of heuristics to solve it. More recently, heuristics based on progressive alignment have highlighted due to the quality of the alignment and relatively good performance. Despite significant advances, MSA remains a time-consuming task and parallel solutions have been investigated. We propose a novel algorithm for solving MSA based on progressive alignment using cluster of GPUs. Our experimental results showed encouraging speedups for instances containing sequences ranging in length between 60 and 10k.","PeriodicalId":262603,"journal":{"name":"2017 IEEE 17th International Conference on Bioinformatics and Bioengineering (BIBE)","volume":"70 36","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 17th International Conference on Bioinformatics and Bioengineering (BIBE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIBE.2017.00-59","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Multiple sequence alignment (MSA) is critical in several areas of science, especially in bioinformatics. Expressive advances have been developed in MSA and many methods, algorithms and tools have been proposed for it. Since the MSA is an NP-hard problem, efforts have led to the emergence of heuristics to solve it. More recently, heuristics based on progressive alignment have highlighted due to the quality of the alignment and relatively good performance. Despite significant advances, MSA remains a time-consuming task and parallel solutions have been investigated. We propose a novel algorithm for solving MSA based on progressive alignment using cluster of GPUs. Our experimental results showed encouraging speedups for instances containing sequences ranging in length between 60 and 10k.