.png){kind=icon}
返回
Simple and Efficient Pattern Matching Algorithms for Biological Sequences
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2969038.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The remarkable growth of biological data is a motivation to accelerate the discovery of solutions in many domains of computational bioinformatics. In different phases of the computational pipelines, pattern matching is a very practical operation. For example, pattern matching enables users to find the locations of particular DNA subsequences in a database or DNA sequence. Furthermore, in these expanding biological databases, some patterns are updated over time. To perform faster searches, high-speed pattern matching algorithms are needed. The present paper introduces three pattern matching algorithms that are specially formulated to speed up searches on large DNA sequences. The proposed algorithms raise performance by utilizing word processing (in place of the character processing presented in previous works) and also by searching the least frequent word of the pattern in the sequence. In terms of time cost, the experimental results demonstrate the superiority of the presented algorithms over the other simulated algorithms.
Keyword:
Bioinformatics
string matching
DNA sequence
frequent pattern
exact algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Acute encephalopathy with bilateral striatal necrosis: favourable response to corticosteroid therapy
PREAI
分享收藏Exact String Matching Algorithms: Survey, Issues, and Future Research Directions.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏
分享收藏
查看更多内容