.png){kind=icon}
返回
Mining frequent biological sequences based on bitmap without candidate sequence generation
.png){kind=icon}
OA
AI
DOI：10.1016/j.compbiomed.2015.12.016.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Biological sequence
Frequent pattern
Bitmap
Quicksort list
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
8.3K
被引数:
3.3W
机构
引用论文
Tandem repeats finder: a program to analyze DNA sequences串联重复序列查找器: 分析DNA序列的程序.png)
NUCLEIC ACIDS RESEARCHOAAI
NUCLEIC ACIDS RESEARCHIF13.1
OAAI分享收藏
Index-BitTableFI: An improved algorithm for mining frequent itemsetsIndex-bittablefi: 一种改进的频繁项集挖掘算法
PREAI
分享收藏
查看更多内容