.png){kind=icon}
返回
A Simple, Fast, Filter-Based Algorithm for Approximate Circular Pattern Matching
.png){kind=icon}
PRE
AI
DOI：10.1109/TNB.2016.2542062.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper deals with the approximate version of the circular pattern matching (ACPM) problem, which appears as an interesting problem in many biological contexts. The circular pattern matching problem consists in finding all occurrences of the rotations of a pattern P of length m in a text T of length n. In ACPM, we consider occurrences with k-mismatches under the Hamming distance model. In this paper, we present a simple and fast filter-based algorithm to solve the ACPM problem. We compare our algorithm with the state of the art algorithms and the results are found to be excellent. In particular, our algorithm runs almost twice as fast than the state of the art. Much of the efficiency of our algorithm can be attributed to its filters that are effective but extremely simple and lightweight.
Keyword:
Circular DNA sequence
circular pattern matching
pattern recognition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.4K
被引数:
2.5K
机构
引用论文
.png){kind=icon}
Canola (Brassica napus) Response to Simulated Sprayer Contamination with Thifensulfuron and Thifensulfuron:Tribenuron (2:1)油菜 (Brassica napus) 对噻吩磺隆和噻吩磺隆:氯磺隆 (2:1) 模拟喷雾器污染的响应
PREAI
分享收藏 没有更多内容
没有更多内容