Improving the Efficiency of Exact Two Dimensional On-line Pattern Matching Algorithms

被引:0
|
作者
Kouzinopoulos, Charalarnpos S. [1 ]
Margaritis, Konstantincis G. [1 ]
机构
[1] Univ Macedonia, Dept Appl Informat, Parallel & Distributed Proc Lab, Thessaloniki 54006, Greece
关键词
D O I
10.1109/PCI.2008.8
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper presents new efficient variants of the Baker and Bird and the Baeza-Yates and Regnier exact two dimensional pattern matching algorithms. Both the original a algorithms and the variants are compared in terms of running time for different sets of data.
引用
收藏
页码:232 / 236
页数:5
相关论文
共 50 条
  • [1] Practical fast on-line exact pattern matching algorithms for highly similar sequences
    Ben Nsira, Nadia
    Lecroq, Thierry
    Prieur-Gaston, Elise
    PROCEEDINGS 2018 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM), 2018, : 1772 - 1777
  • [2] Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
    Giancarlo, Raffaele
    Grossi, Roberto
    Journal of Algorithms, 1997, 24 (02): : 223 - 265
  • [3] Multi-dimensional pattern matching with dimensional wildcards: Data structures and optimal on-line search algorithms
    Giancarlo, R
    Grossi, R
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1997, 24 (02): : 223 - 265
  • [4] Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms
    Amir, Amihood
    Porat, Benny
    ALGORITHMS AND COMPUTATION, 2013, 8283 : 55 - 65
  • [5] On-line weighted pattern matching
    Charalampopoulos, Panagiotis
    Iliopoulos, Costas S.
    Pissis, Solon R.
    Radoszewski, Jakub
    INFORMATION AND COMPUTATION, 2019, 266 : 49 - 59
  • [6] Analysis of two-dimensional approximate pattern matching algorithms
    Park, K
    THEORETICAL COMPUTER SCIENCE, 1998, 201 (1-2) : 263 - 273
  • [7] Approximation algorithms for maximum two-dimensional pattern matching
    Arikati, SR
    Dessmark, A
    Lingas, A
    Marathe, MV
    THEORETICAL COMPUTER SCIENCE, 2001, 255 (1-2) : 51 - 62
  • [8] How the character comparison order shapes the shift function of on-line pattern matching algorithms
    Colussi, L
    Toniolo, L
    THEORETICAL COMPUTER SCIENCE, 1996, 163 (1-2) : 117 - 144
  • [9] Optimal exact and fast approximate two dimensional pattern matching allowing rotations
    Fredriksson, K
    Navarro, G
    Ukkonen, E
    COMBINATORIAL PATTERN MATCHING, 2002, 2373 : 235 - 248
  • [10] Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton
    Prusa, Daniel
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2017, 28 (05) : 623 - 640