Faster two-dimensional pattern matching with rotations

被引：13
|
作者：
Amir, Amihood [1 ]
Kapah, Oren
Tsur, Dekel
机构：
[1] Bar Ilan Univ, Dept Comp Sci, IL-52900 Ramat Gan, Israel
[2] Bar Ilan Univ, Dept Comp Sci, IL-52900 Ramat Gan, Israel
[3] Ben Gurion Univ Negev, Dept Comp Sci, IL-84105 Beer Sheva, Israel
来源：
THEORETICAL COMPUTER SCIENCE | 2006年 / 368卷 / 03期
基金：
以色列科学基金会; 美国国家科学基金会;
关键词：
design and analysis of algorithms; two-dimensional pattern matching; rotation;
D O I：
10.1016/j.tcs.2006.09.012
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The most efficient currently known algorithms for two-dimensional pattern matching with rotations have a worst case time complexity of O(n(2)m(3)), where the size of the text is n x n and the size of the pattern is m x m. In this paper we present a new algorithm for the problem whose running time is 0(n(2),m(2)). (c) 2006 Published by Elsevier B.V.
引用
收藏
页码：196 / 204
页数：9
相关论文
共 50 条
  • [21] On the complexity of pattern matching for highly compressed two-dimensional texts
    Berman, P
    Karpinski, M
    Larmore, LL
    Plandowski, W
    Rytter, W
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2002, 65 (02) : 332 - 350
  • [22] Two-Dimensional Pattern Matching Against Basic Picture Languages
    Mraz, Frantisek
    Prusa, Daniel
    Wehar, Michael
    IMPLEMENTATION AND APPLICATION OF AUTOMATA (CIAA 2019), 2019, 11601 : 209 - 221
  • [23] On the complexity of pattern matching for highly compressed two-dimensional texts
    Berman, P
    Karpinski, M
    Larmore, LL
    Plandowski, W
    Rytter, W
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 1997, 1264 : 40 - 51
  • [24] A new approach to two-dimensional pattern matching allowing errors
    Sang, ZQ
    Ding, MY
    Zhang, TX
    1997 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT PROCESSING SYSTEMS, VOLS 1 & 2, 1997, : 1009 - 1013
  • [25] EFFICIENT TWO-DIMENSIONAL PATTERN-MATCHING IN THE PRESENCE OF ERRORS
    KRITHIVASAN, K
    SITALAKSHMI, R
    INFORMATION SCIENCES, 1987, 43 (03) : 169 - 184
  • [26] Point pattern matching in the analysis of two-dimensional gel electropherograms
    Pánek, J
    Vohradsky, J
    ELECTROPHORESIS, 1999, 20 (18) : 3483 - 3491
  • [27] ON TWO-DIMENSIONAL PATTERN-MATCHING LANGUAGES AND THEIR DECISION-PROBLEMS
    MORITA, K
    NAKAZONO, K
    SUGATA, K
    INFORMATION SCIENCES, 1986, 40 (01) : 53 - 66
  • [28] A constant time optimal parallel algorithm for two-dimensional pattern matching
    Crochemore, M
    Gasieniec, L
    Hariharan, R
    Muthukrishnan, S
    Rytter, W
    SIAM JOURNAL ON COMPUTING, 1998, 27 (03) : 668 - 681
  • [29] Two-Dimensional Parameterized Matching
    Cole, Richard
    Hazay, Carmit
    Lewenstein, Moshe
    Tsur, Dekel
    ACM TRANSACTIONS ON ALGORITHMS, 2014, 11 (02) : 1 - 30
  • [30] Smart Templates for peak pattern matching with comprehensive two-dimensional liquid chromatography
    Reichenbach, Stephen E.
    Carr, Peter W.
    Stoll, Dwight R.
    Tao, Qingping
    JOURNAL OF CHROMATOGRAPHY A, 2009, 1216 (16) : 3458 - 3466
12345