A Quantum-inspired optimization Heuristic for the Multiple Sequence Alignment Problem in Bio-computing

Konstantinos Giannakis, Christos Papalitsas, Georgia Theocharopoulou, Sofia Fanarioti, T. Andronikos
{"title":"A Quantum-inspired optimization Heuristic for the Multiple Sequence Alignment Problem in Bio-computing","authors":"Konstantinos Giannakis, Christos Papalitsas, Georgia Theocharopoulou, Sofia Fanarioti, T. Andronikos","doi":"10.1109/IISA.2019.8900740","DOIUrl":null,"url":null,"abstract":"Data related to biology are characterized by large volume and requirements for enormous computational power. Biological sequences, either of proteins or DNA/RNA segments, can be large and usually need massive computations in order to discover relations and study particular properties. Aligning sequences is of great importance for various practical reasons. Multiple sequence alignment studies the problem of aligning several strings resulting in a complete alignment, a problem for which several different approaches exist. In this work, a novel heuristic method to progressively solve this problem is proposed using elements of quantum-inspired optimization. The proposed algorithm is described in detail and evaluated through simulations against other aligning methods. The experimental results seem promising for providing a good initial alignment, especially for the case of large sets of sequences.","PeriodicalId":371385,"journal":{"name":"2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IISA.2019.8900740","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Data related to biology are characterized by large volume and requirements for enormous computational power. Biological sequences, either of proteins or DNA/RNA segments, can be large and usually need massive computations in order to discover relations and study particular properties. Aligning sequences is of great importance for various practical reasons. Multiple sequence alignment studies the problem of aligning several strings resulting in a complete alignment, a problem for which several different approaches exist. In this work, a novel heuristic method to progressively solve this problem is proposed using elements of quantum-inspired optimization. The proposed algorithm is described in detail and evaluated through simulations against other aligning methods. The experimental results seem promising for providing a good initial alignment, especially for the case of large sets of sequences.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
生物计算中多序列比对问题的量子启发式优化
与生物学相关的数据具有体积大、计算能力强的特点。生物序列,无论是蛋白质还是DNA/RNA片段,都可能很大,通常需要大量的计算才能发现关系并研究特定的性质。由于各种实际原因,序列对齐非常重要。多序列比对研究的是对多个字符串进行完全比对的问题,这是一个存在多种不同方法的问题。在这项工作中,提出了一种新的启发式方法来逐步解决这个问题,使用量子启发优化的元素。本文对该算法进行了详细的描述,并与其他对准方法进行了仿真评估。实验结果似乎有希望提供一个良好的初始比对,特别是在大序列集的情况下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A NoSQL Approach for Aspect Mining of Cultural Heritage Streaming Data Advancing Adult Online Education through a SN-Learning Environment Smart educational games and Consent under the scope of General Data Protection Regulation Timetable Scheduling Using a Hybrid Particle Swarm Optimization with Local Search Approach Data Mining for Smart Cities: Predicting Electricity Consumption by Classification
×
引用
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