【24h】

Aligning multiple sequences by genetic algorithm

机译:通过遗传算法比对多个序列

获取原文

摘要

This paper presents a genetic algorithm for solving the multiple sequence alignment in bioinformatics. The algorithm involves four different operators, one type of selection operator, two types of crossover operators, and one type of mutation operator, the mutation operator is realized by dynamic programming method. Experimental results of benchmarks from the BAliBASE show that the proposed algorithm is feasible to align the equidistant protein sequences, and the quality of alignment is comparable to that obtained with ClustalX.
机译:本文提出了一种遗传算法,用于解决生物信息学中的多序列比对问题。该算法涉及四种不同的算子,一种是选择算子,两种是交叉算子,一种是变异算子,该变异算子是通过动态规划方法实现的。 BAliBASE基准测试的实验结果表明,该算法可用于比对等距蛋白质序列,并且比对质量与ClustalX相当。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号