基于多目标人工蜂群算法的多序列比对

Najwa Altwaijry, Malak Almasoud, Areej Almalki, Isra M. Al-Turaiki
{"title":"基于多目标人工蜂群算法的多序列比对","authors":"Najwa Altwaijry, Malak Almasoud, Areej Almalki, Isra M. Al-Turaiki","doi":"10.1109/ICCAIS48893.2020.9096734","DOIUrl":null,"url":null,"abstract":"Multiple sequences alignment is an essential task in many bioinformatics analyses. However, it is a challenging problem due to its exponential complexity. Although many approaches have been proposed for solving the MSA problem, finding the best alignment of the MSA remains an open problem. In this work, we propose a new multiobjective optimization approach based on the Artificial Bee Colony (ABC) algorithm to solve the MSA problem. The ABC algorithm is inspired by the intelligent behavior of honey bee swarms. Our proposed approach optimizes two objective functions; the sum-of-pairs (SP) function and entropy. Optimizing these objective functions represents a trade off between maximizing the SP function and minimizing the entropy to choose the most suitable alignment. Experiments are conducted on 12 datasets from BAliBASE 3.0. The experimental results show that our proposed approach achieves better alignments than Clustal in four of the tested datasets. In general, the proposed approach performs better on RV12 datasets.","PeriodicalId":422184,"journal":{"name":"2020 3rd International Conference on Computer Applications & Information Security (ICCAIS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Multiple Sequence Alignment using a Multiobjective Artificial Bee Colony Algorithm\",\"authors\":\"Najwa Altwaijry, Malak Almasoud, Areej Almalki, Isra M. Al-Turaiki\",\"doi\":\"10.1109/ICCAIS48893.2020.9096734\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiple sequences alignment is an essential task in many bioinformatics analyses. However, it is a challenging problem due to its exponential complexity. Although many approaches have been proposed for solving the MSA problem, finding the best alignment of the MSA remains an open problem. In this work, we propose a new multiobjective optimization approach based on the Artificial Bee Colony (ABC) algorithm to solve the MSA problem. The ABC algorithm is inspired by the intelligent behavior of honey bee swarms. Our proposed approach optimizes two objective functions; the sum-of-pairs (SP) function and entropy. Optimizing these objective functions represents a trade off between maximizing the SP function and minimizing the entropy to choose the most suitable alignment. Experiments are conducted on 12 datasets from BAliBASE 3.0. The experimental results show that our proposed approach achieves better alignments than Clustal in four of the tested datasets. In general, the proposed approach performs better on RV12 datasets.\",\"PeriodicalId\":422184,\"journal\":{\"name\":\"2020 3rd International Conference on Computer Applications & Information Security (ICCAIS)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 3rd International Conference on Computer Applications & Information Security (ICCAIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCAIS48893.2020.9096734\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 3rd International Conference on Computer Applications & Information Security (ICCAIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCAIS48893.2020.9096734","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

多序列比对是生物信息学分析中的一项重要任务。然而,由于其指数复杂度,这是一个具有挑战性的问题。尽管已经提出了许多解决MSA问题的方法,但找到MSA的最佳对齐仍然是一个开放的问题。本文提出了一种新的基于人工蜂群(ABC)算法的多目标优化方法来解决MSA问题。ABC算法的灵感来自于蜂群的智能行为。我们提出的方法优化了两个目标函数;对和函数(SP)和熵。优化这些目标函数代表了最大化SP函数和最小化熵之间的权衡,以选择最合适的对齐方式。在BAliBASE 3.0的12个数据集上进行了实验。实验结果表明,我们的方法在四个测试数据集上取得了比Clustal更好的对齐效果。总的来说,该方法在RV12数据集上表现更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Multiple Sequence Alignment using a Multiobjective Artificial Bee Colony Algorithm
Multiple sequences alignment is an essential task in many bioinformatics analyses. However, it is a challenging problem due to its exponential complexity. Although many approaches have been proposed for solving the MSA problem, finding the best alignment of the MSA remains an open problem. In this work, we propose a new multiobjective optimization approach based on the Artificial Bee Colony (ABC) algorithm to solve the MSA problem. The ABC algorithm is inspired by the intelligent behavior of honey bee swarms. Our proposed approach optimizes two objective functions; the sum-of-pairs (SP) function and entropy. Optimizing these objective functions represents a trade off between maximizing the SP function and minimizing the entropy to choose the most suitable alignment. Experiments are conducted on 12 datasets from BAliBASE 3.0. The experimental results show that our proposed approach achieves better alignments than Clustal in four of the tested datasets. In general, the proposed approach performs better on RV12 datasets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
ICCAIS 2020 Copyright Page The Best-Worst Method for Resource Allocation and Task Scheduling in Cloud Computing A Recommender System for Linear Satellite TV: Is It Possible? Proactive Priority Based Response to Road Flooding using AHP: A Case Study in Dammam Data and Location Privacy Issues in IoT Applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1