.png){kind=icon}
返回
Efficient dynamic programming alignment of cyclic strings by shift elimination
.png){kind=icon}
PRE
AI
DOI：10.1016/0031-3203(95)00144-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Optimal alignment of two strings of length m and n is computed in time O(mn) by dynamic programming. When the strings represent cyclic patterns, the alignment computation must consider all possible shifts and the computation complexity increases accordingly. We present an algorithm for efficient dynamic programming alignment of cyclic strings which uses a previously established channeling technique to reduce the complexity of each alignment and a new shift elimination technique to reduce the number of alignments carried out. The result is a data-dependent time complexity that varies between O(2mn) and O(mn log(2) n). An experimental evaluation is provided using randomly generated sequences. Copyright (C) 1996 Pattern Recognition Society.
Keyword:
cyclic patterns
string matching
pattern analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
分享收藏Charged particle therapy to pediatric tumors of the retroperitoneal region: A possible indication
OAAI
OAAI分享收藏Dietary restraint and self-reported meal sizes: diary studies with differentially informed consent.png)
Appetite
AppetiteIF0
PREAI
分享收藏分享收藏
没有更多内容
没有更多内容