首页> 外文会议>2017 4th International Conference on Signal Processing, Computing and Control >Pairwise sequence alignment method using flower pollination algorithm
【24h】

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.
机译:生物分子序列比对是生物信息学的重要研究领域。基于花卉授粉算法(FPA),我们提出了一种新的序列比对算法,称为成对序列比对与花卉授粉算法(PSAFPA)。 PSAFPA有助于找到序列比对问题的最佳解决方案。 PSAFPA首先借助FPA找到当前最佳的解决方案,然后将该解决方案分为不匹配区域的各个部分以找到更好的结果。使用FPA重新排列这些片段,最后将每个片段的最佳标识值添加到当前最佳解决方案中,以获得最终的比对标识值。这种细分有助于获得更好的结果。我们还将PSAFPA与使用各种DNA序列对的众所周知的方法进行了比较,从而使PSAFPA在大多数序列对中具有更好的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号