.png){kind=icon}
返回
Order preserving pattern matching revisited
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2014.11.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study the order preserving pattern matching (OPPM) problem, which is a very recent variant of the classic pattern matching problem. We revisit this variant, present a new interesting pattern matching algorithm and for the first time consider string regularities from this new perspective. (C) 2014 Published by Elsevier B.V.
Keyword:
Algorithms
Pattern matching
Document processing
Sequence analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
暂无机构信息
.png){kind=icon}
