首页> 外文期刊>Computers in Biology and Medicine >Mining frequent biological sequences based on bitmap without candidate sequence generation
【24h】

Mining frequent biological sequences based on bitmap without candidate sequence generation

机译:基于位图的频繁生物序列挖掘,无需候选序列生成

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

摘要

Biological sequences carry a lot of important genetic information of organisms. Furthermore, there is an inheritance law related to protein function and structure which is useful for applications such as disease prediction. Frequent sequence mining is a core technique for association rule discovery, but existing algorithms suffer from low efficiency or poor error rate because biological sequences differ from general sequences with more characteristics. In this paper, an algorithm for mining Frequent Biological Sequence based on Bitmap, FBSB, is proposed. FBSB uses bitmaps as the simple data structure and transforms each row into a quicksort list QS-list for sequence growth. For the continuity and accuracy requirement of biological sequence mining, tested sequences used during the mining process of FBSB are real ones instead of generated candidates, and all the frequent sequences can be mined without any errors. Comparing with other algorithms, the experimental results show that FBSB can achieve a better performance on both run time and scalability. (C) 2015 Elsevier Ltd. All rights reserved.
机译:生物序列带有许多重要的生物遗传信息。此外,存在与蛋白质功能和结构有关的遗传规律,可用于疾病预测等应用。频繁序列挖掘是发现关联规则的一项核心技术,但是现有的算法效率低或错误率低,因为生物序列不同于具有更多特征的常规序列。提出了一种基于位图的频繁生物序列挖掘算法FBSB。 FBSB使用位图作为简单的数据结构,并将每一行转换为快速排序列表QS-list以进行序列增长。为了满足生物序列挖掘的连续性和准确性要求,在FBSB挖掘过程中使用的测试序列是真实序列,而不是生成的候选序列,并且所有频繁序列均可被正确挖掘。与其他算法相比,实验结果表明FBSB可以在运行时间和可伸缩性上实现更好的性能。 (C)2015 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号