首页> 外文会议>International Conference on ICT on Sustainable Development >Compression for DNA Sequences Using Huffman Encoding
【24h】

Compression for DNA Sequences Using Huffman Encoding

机译:使用Huffman编码压制DNA序列

获取原文

摘要

Over the last two decades, the DNA sequence handling and storing problem has been considered as a big problem for many bioinformatics researchers because genomic databases are increasing drastically. To handle this problem, computational biology plays an important role, such as searching for homology, genome formulation, predicting for a new protein sequence, hereditary control networks, and new creative genomics structure. Available resources are not sufficient for storing and handling large DNA sequences. There are various tools developed by using different algorithms and approach. We have proposed an algorithm to improve the compression ratio which uses the concept of RLE (run length encoding) with a Modified HuffBit algorithm. The results obtained by the proposed method are found to be 20% more accurate when compared to existing algorithms.
机译:在过去的二十年中,DNA序列处理和存储问题被认为是许多生物信息学研究人员的一个大问题,因为基因组数据库正在大幅增加。为了处理这个问题,计算生物学起着重要作用,例如寻找同源性,基因组制剂,预测新的蛋白质序列,遗传控制网络和新的创意基因组学结构。可用资源不足以存储和处理大型DNA序列。通过使用不同的算法和方法开发了各种工具。我们已经提出了一种提高使用RLE概念(运行长度编码)与修改的HUFFBET算法的压缩比的算法。与现有算法相比,所提出的方法获得的结果是更准确的20%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号