基于粒子群优化的多序列比对改进算法

P. Jagadamba, M. S. Prasad Babu, A. A. Rao, P. Krishna Subba Rao
{"title":"基于粒子群优化的多序列比对改进算法","authors":"P. Jagadamba, M. S. Prasad Babu, A. A. Rao, P. Krishna Subba Rao","doi":"10.1109/ICSESS.2011.5982374","DOIUrl":null,"url":null,"abstract":"Sequence alignment is one of the challenging problems in the analysis of biological data for identifying the diseases. Numbers of Sequence alignment algorithms are developed to identify highly scoring alignment between the sequences. Many of these sequence alignment algorithms use Dynamic Programming technique. In this paper a new algorithm, namely, Multiple Sequence Alignment using Particle Swarm Optimization (MSAPSO) is proposed to multiple sequence alignment. This algorithm is developed using Particle Swarm Optimization technique instead of Dynamic Programming technique. This algorithm works on both nucleotide sequences and protein sequences. The proposed approach tries to improve the sequence alignment proposed by Needleman Wunsch algorithm.","PeriodicalId":108533,"journal":{"name":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"An improved algorithm for Multiple Sequence Alignment using Particle Swarm Optimization\",\"authors\":\"P. Jagadamba, M. S. Prasad Babu, A. A. Rao, P. Krishna Subba Rao\",\"doi\":\"10.1109/ICSESS.2011.5982374\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sequence alignment is one of the challenging problems in the analysis of biological data for identifying the diseases. Numbers of Sequence alignment algorithms are developed to identify highly scoring alignment between the sequences. Many of these sequence alignment algorithms use Dynamic Programming technique. In this paper a new algorithm, namely, Multiple Sequence Alignment using Particle Swarm Optimization (MSAPSO) is proposed to multiple sequence alignment. This algorithm is developed using Particle Swarm Optimization technique instead of Dynamic Programming technique. This algorithm works on both nucleotide sequences and protein sequences. The proposed approach tries to improve the sequence alignment proposed by Needleman Wunsch algorithm.\",\"PeriodicalId\":108533,\"journal\":{\"name\":\"2011 IEEE 2nd International Conference on Software Engineering and Service Science\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE 2nd International Conference on Software Engineering and Service Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSESS.2011.5982374\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS.2011.5982374","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

序列比对是识别疾病的生物学数据分析中具有挑战性的问题之一。开发了许多序列比对算法来识别序列之间的高评分比对。许多序列比对算法使用动态规划技术。本文提出了一种基于粒子群优化的多序列比对算法(MSAPSO)。该算法采用粒子群优化技术代替动态规划技术。该算法适用于核苷酸序列和蛋白质序列。该方法对Needleman - Wunsch算法提出的序列比对方法进行了改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improved algorithm for Multiple Sequence Alignment using Particle Swarm Optimization
Sequence alignment is one of the challenging problems in the analysis of biological data for identifying the diseases. Numbers of Sequence alignment algorithms are developed to identify highly scoring alignment between the sequences. Many of these sequence alignment algorithms use Dynamic Programming technique. In this paper a new algorithm, namely, Multiple Sequence Alignment using Particle Swarm Optimization (MSAPSO) is proposed to multiple sequence alignment. This algorithm is developed using Particle Swarm Optimization technique instead of Dynamic Programming technique. This algorithm works on both nucleotide sequences and protein sequences. The proposed approach tries to improve the sequence alignment proposed by Needleman Wunsch algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信