首页> 外文会议>IEEE International Conference on Computational Intelligence and Computing Research >Nature Inspired Algorithms for Genome Subsequence Assembly in Hadoop
【24h】

Nature Inspired Algorithms for Genome Subsequence Assembly in Hadoop

机译:Hadoop中基因组子序列装配的自然启发算法

获取原文

摘要

Genome subsequencing has become one of the normal requirements of the modern era due to the huge possibilities it provides for personalized medicine. Assembled genome sequencing will give valuable consciousness into numerous aspects of human life, thereby generating healthier environments and personalized treatments. The most important need of this field is for a quicker and accurate sequencing device. The methods for genome sequencing become very hard due to the massive amount of genome fragments. This paper extents an optimized genome assembly technique with nature inspired algorithm using MapReduce. DNA subsequence is initially matched with the genome to identify the possible matching locations. These identified points are then analyzed for complete matches. The consensus sequence assembly is performed by employing hamming distance identical systems. The experimental outcomes analyzed display that our method is improved and shows high coverage by providing exact sequence alignments.
机译:基因组子测序由于其提供个性化医学的巨大可能性而已成为现代的常规要求之一。组装好的基因组测序将使人类生活的各个方面具有宝贵的意识,从而产生更健康的环境和个性化的治疗方法。该领域最重要的需求是需要一种更快,更准确的测序设备。由于大量的基因组片段,用于基因组测序的方法变得非常困难。本文利用MapReduce扩展了具有自然启发性算法的优化基因组组装技术。 DNA子序列首先与基因组匹配,以识别可能的匹配位置。然后对这些识别出的点进行完整匹配分析。通过采用汉明距离相同的系统来执行共有序列的组装。分析的实验结果表明,我们的方法得到了改进,并通过提供精确的序列比对显示出较高的覆盖率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号