Á. Rubio-Largo, M. A. Vega-Rodríguez, D. L. González-Álvarez
{"title":"并行H4MSA多序列比对","authors":"Á. Rubio-Largo, M. A. Vega-Rodríguez, D. L. González-Álvarez","doi":"10.1109/Trustcom.2015.639","DOIUrl":null,"url":null,"abstract":"Multiple Sequence Alignment (MSA) is the process of aligning three or more nucleotides/amino-acids sequences at the same time. It is an NP-complete optimization problem where the time complexity of finding an optimal alignment raises exponentially when the number of sequences to align increases. In the multiobjective version of the MSA problem, we simultaneously optimize the alignment accuracy and conservation. In this work, we present a parallel scheme for a multiobjective version of a memetic metaheuristic: Hybrid Multiobjective Memetic Metaheuristics for Multiple Sequence Alignment (H4MSA). In order to evaluate the parallel performance of H4MSA, we use several datasets with different number of sequences (up to 1000 sequences) and compare its parallel performance against other well-known parallel approaches published in the literature, such as MSAProbs, T-Coffee, Clustal O and MAFFT. On the other hand, the results reveals that parallel H4MSA is around 25 times faster than the sequential version with 32 cores.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Parallel H4MSA for Multiple Sequence Alignment\",\"authors\":\"Á. Rubio-Largo, M. A. Vega-Rodríguez, D. L. González-Álvarez\",\"doi\":\"10.1109/Trustcom.2015.639\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiple Sequence Alignment (MSA) is the process of aligning three or more nucleotides/amino-acids sequences at the same time. It is an NP-complete optimization problem where the time complexity of finding an optimal alignment raises exponentially when the number of sequences to align increases. In the multiobjective version of the MSA problem, we simultaneously optimize the alignment accuracy and conservation. In this work, we present a parallel scheme for a multiobjective version of a memetic metaheuristic: Hybrid Multiobjective Memetic Metaheuristics for Multiple Sequence Alignment (H4MSA). In order to evaluate the parallel performance of H4MSA, we use several datasets with different number of sequences (up to 1000 sequences) and compare its parallel performance against other well-known parallel approaches published in the literature, such as MSAProbs, T-Coffee, Clustal O and MAFFT. On the other hand, the results reveals that parallel H4MSA is around 25 times faster than the sequential version with 32 cores.\",\"PeriodicalId\":277092,\"journal\":{\"name\":\"2015 IEEE Trustcom/BigDataSE/ISPA\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-08-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Trustcom/BigDataSE/ISPA\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/Trustcom.2015.639\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Trustcom/BigDataSE/ISPA","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/Trustcom.2015.639","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multiple Sequence Alignment (MSA) is the process of aligning three or more nucleotides/amino-acids sequences at the same time. It is an NP-complete optimization problem where the time complexity of finding an optimal alignment raises exponentially when the number of sequences to align increases. In the multiobjective version of the MSA problem, we simultaneously optimize the alignment accuracy and conservation. In this work, we present a parallel scheme for a multiobjective version of a memetic metaheuristic: Hybrid Multiobjective Memetic Metaheuristics for Multiple Sequence Alignment (H4MSA). In order to evaluate the parallel performance of H4MSA, we use several datasets with different number of sequences (up to 1000 sequences) and compare its parallel performance against other well-known parallel approaches published in the literature, such as MSAProbs, T-Coffee, Clustal O and MAFFT. On the other hand, the results reveals that parallel H4MSA is around 25 times faster than the sequential version with 32 cores.