.png){kind=icon}
返回
Efficient String Matching Algorithm for Searching Large DNA and Binary Texts
.png){kind=icon}
PRE
AI
DOI：10.4018/IJSWIS.2017100110.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The exact string matching is essential in application areas such as Bioinformatics and Intrusion Detection Systems. Speeding-up the string matching algorithm will therefore result in accelerating the searching process in DNA and binary data. Previously, there are two types of fast algorithms exist, bit-parallel based algorithms and hashing algorithms. The bit-parallel based are efficient when dealing with patterns of short lengths, less than 64, but slow on long patterns. On the other hand, hashing algorithms have optimal sublinear average case on large alphabets and long patterns, but the efficiency not so good on small alphabet such as DNA and binary texts. In this paper, the authors present hybrid algorithm to overcome the shortcomings of those previous algorithms. The proposed algorithm is based on q-gram hashing with guaranteeing the maximal shift in advance. Experimental results on random and complete human genome confirm that the proposed algorithm is efficient on various pattern lengths and small alphabet.
Keyword:
DNA Searching
Hashing
q-Gram Practical Algorithms
String Matching
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
5.6
论文数:
471
被引数:
914
机构
引用论文
.png){kind=icon}
Idiopathic subglottic stenosis and the relationship to menses in a 12‐year‐old girl特发性声门下狭窄与月经的关系：一例12岁女孩的病例
PREAI
分享收藏
查看更多内容