基于花授粉算法的成对序列比对方法

Yadvir Kaur, N. Sohi
{"title":"基于花授粉算法的成对序列比对方法","authors":"Yadvir Kaur, N. Sohi","doi":"10.1109/ISPCC.2017.8269713","DOIUrl":null,"url":null,"abstract":"Biomolecular sequence alignment is an important research area in bioinformatics. Based on Flower Pollination Algorithm (FPA), we have proposed a new sequence alignment algorithm, named Pairwise Sequence Alignment with Flower Pollination Algorithm (PSAFPA). PSAFPA helps in finding the optimal or near-optimal solution to sequence alignment problem. PSAFPA first finds the current best solution with the help of FPA and then divides this solution into various segments of non-matching regions to find the better results. These segments are rearranged using FPA and finally the best identity value of each segment is added into the current best solution to get the final alignment identity value. Such segmentation helped to get better results. We have also done comparison of PSAFPA with the well-known methods using various DNA sequence pairs, which resulted in to better performance of PSAFPA for a majority of sequence pairs.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Pairwise sequence alignment method using flower pollination algorithm\",\"authors\":\"Yadvir Kaur, N. Sohi\",\"doi\":\"10.1109/ISPCC.2017.8269713\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Biomolecular sequence alignment is an important research area in bioinformatics. Based on Flower Pollination Algorithm (FPA), we have proposed a new sequence alignment algorithm, named Pairwise Sequence Alignment with Flower Pollination Algorithm (PSAFPA). PSAFPA helps in finding the optimal or near-optimal solution to sequence alignment problem. PSAFPA first finds the current best solution with the help of FPA and then divides this solution into various segments of non-matching regions to find the better results. These segments are rearranged using FPA and finally the best identity value of each segment is added into the current best solution to get the final alignment identity value. Such segmentation helped to get better results. We have also done comparison of PSAFPA with the well-known methods using various DNA sequence pairs, which resulted in to better performance of PSAFPA for a majority of sequence pairs.\",\"PeriodicalId\":142166,\"journal\":{\"name\":\"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPCC.2017.8269713\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPCC.2017.8269713","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

生物分子序列比对是生物信息学的一个重要研究领域。在花授粉算法(FPA)的基础上,提出了一种新的序列比对算法——PSAFPA (PSAFPA)。PSAFPA有助于找到序列比对问题的最优或接近最优解。PSAFPA首先借助FPA找到当前最优解,然后将该解划分为各个不匹配区域的片段,以寻找更好的结果。使用FPA对这些段进行重新排列,最后将每个段的最佳标识值添加到当前最优解中,得到最终的对齐标识值。这样的细分有助于获得更好的结果。我们还将PSAFPA与使用各种DNA序列对的已知方法进行了比较,结果表明PSAFPA对大多数序列对具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Pairwise sequence alignment method using flower pollination algorithm
Biomolecular sequence alignment is an important research area in bioinformatics. Based on Flower Pollination Algorithm (FPA), we have proposed a new sequence alignment algorithm, named Pairwise Sequence Alignment with Flower Pollination Algorithm (PSAFPA). PSAFPA helps in finding the optimal or near-optimal solution to sequence alignment problem. PSAFPA first finds the current best solution with the help of FPA and then divides this solution into various segments of non-matching regions to find the better results. These segments are rearranged using FPA and finally the best identity value of each segment is added into the current best solution to get the final alignment identity value. Such segmentation helped to get better results. We have also done comparison of PSAFPA with the well-known methods using various DNA sequence pairs, which resulted in to better performance of PSAFPA for a majority of sequence pairs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Performance comparison of Type-1 and Type-2 fuzzy logic systems Optimal sizing of standalone small rotor wind and diesel system with energy storage for low speed wind operation A distributed method of key issue and revocation of mobile ad hoc networks using curve fitting FPGA implementation of unsigned multiplier circuit based on quaternary signed digit number system A novel technique of cloud security based on hybrid encryption by Blowfish and MD5
×
引用
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