【24h】

A Graph-Based Genetic Algorithm for the Multiple Sequence Alignment Problem

机译:基于图的遗传算法解决多序列比对问题

获取原文
获取原文并翻译 | 示例

摘要

We developed a new approach for the multiple sequence alignment problem based on Genetic Algorithms (GA). A new method to represent an alignment is proposed as a multidimensional oriented graph, which dramatically decreases the storage complexity. Details of the proposed GA are explained, including new structure-preserving genetic operators. A sensitivity analysis was done for adjusting running parameters of the GA. Performance of the proposed system was evaluated using a benchmark of hand-aligned sequences (Balibase). Overall, the results obtained are comparable or better to those obtained by a well-known software (Clustal). These results are very promising and suggest more efforts for further developments.
机译:我们基于遗传算法(GA)开发了一种解决多序列比对问题的新方法。提出了一种表示对齐的新方法作为面向多维的图,该方法大大降低了存储的复杂性。拟议的遗传算法的细节进行了解释,包括新的结构保持遗传算子。进行了灵敏度分析,以调整GA的运行参数。使用手比对序列的基准(Balibase)评估了所提出系统的性能。总体而言,所获得的结果与通过众所周知的软件(Clustal)获得的结果相当或更好。这些结果非常有希望,并为进一步的发展提出了更多的努力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号