A survey on multiple sequence alignment using metaheuristics

A. Dey, Indrajit Saha, U. Maulik
{"title":"A survey on multiple sequence alignment using metaheuristics","authors":"A. Dey, Indrajit Saha, U. Maulik","doi":"10.1109/CSNT.2017.8418552","DOIUrl":null,"url":null,"abstract":"Over the past two decades, various research works have been going on Multiple Sequence Alignment (MSA) and it becomes an important domain in bioinformatics. This is an NPhard problem. For this purpose, various traditional, heuristics and metaheuristic methods have been applied. Among these methods, metaheuristics show an effective output to overcome the bottleneck of MSA problem. Different metaheuristic methods and software have been developed to overcome the speed and accuracy problem of MSA, while the number of sequences increases. In this article, we have surveyed widely used metaheuristic methods and alignment tools applied for solving MSA problem. However, after reviewing we can conclude that the time complexity is still a big challenge for MSA problem.","PeriodicalId":382417,"journal":{"name":"2017 7th International Conference on Communication Systems and Network Technologies (CSNT)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 7th International Conference on Communication Systems and Network Technologies (CSNT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSNT.2017.8418552","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Over the past two decades, various research works have been going on Multiple Sequence Alignment (MSA) and it becomes an important domain in bioinformatics. This is an NPhard problem. For this purpose, various traditional, heuristics and metaheuristic methods have been applied. Among these methods, metaheuristics show an effective output to overcome the bottleneck of MSA problem. Different metaheuristic methods and software have been developed to overcome the speed and accuracy problem of MSA, while the number of sequences increases. In this article, we have surveyed widely used metaheuristic methods and alignment tools applied for solving MSA problem. However, after reviewing we can conclude that the time complexity is still a big challenge for MSA problem.
基于元启发式的多序列比对研究综述
近二十年来,多序列比对(Multiple Sequence Alignment, MSA)已成为生物信息学的一个重要研究领域。这是一个NPhard问题。为此,各种传统的、启发式的和元启发式的方法被应用。在这些方法中,元启发式方法是克服MSA问题瓶颈的有效方法。随着序列数量的增加,人们开发了不同的元启发式方法和软件来克服MSA的速度和准确性问题。在本文中,我们调查了广泛使用的元启发式方法和校准工具,用于解决MSA问题。然而,经过回顾,我们可以得出结论,时间复杂度仍然是MSA问题的一大挑战。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信