δγ - Parameterized Matching

被引：0
|
作者：
Lee, Inbok [1 ]
Mendivelso, Juan [2 ]
Pinzon, Yoan J. [2 ]
机构：
[1] Hankuk Aviat Univ, Sch Elect Telecommun & Comp Engn, Koyang City, Kyonggi Do, South Korea
[2] Univ Nacl Colombia, Dept Syst & Ind Engn, Res Grp Algorithms & Combinatorics ALGOS UN, Bogota, Colombia
来源：
STRING PROCESSING AND INFORMATION RETRIEVAL, PROCEEDINGS | 2008年 / 5280卷
关键词：
combinatorial algorithms; delta-matching; delta gamma-matching; parameterized matching; bipartite matching;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
This paper defines a new pattern matching problem by combining two paradigms: delta gamma-matching and parameterized matching. The solution is essentially obtained by a combination of bitparallel techniques and a reductions to a graph matching problem. The time complexity of the algorithm is O(nm), assuming text size n, pattern size m and a constant size alphabet.
引用
收藏
页码：236 / +
页数：4
相关论文
共 50 条
  • [41] An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
    Liu, Yuxi
    Xiao, Mingyu
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2024, 2024, 14637 : 86 - 98
  • [42] The deterministic pattern matching based on the parameterized quantum circuit
    Lu Liu
    Xing-Yu Wu
    Chu-Yao Xu
    Lu-Fan Zhang
    Chuan Wang
    EPJ Quantum Technology, 2024, 11
  • [43] On the parameterized vertex cover problem for graphs with perfect matching
    WANG JianXin
    LI WenJun
    LI ShaoHua
    CHEN JianEr
    Science China(Information Sciences), 2014, 57 (07) : 105 - 116
  • [44] A Parameterized Study of Maximum Generalized Pattern Matching Problems
    Ordyniak, Sebastian
    Popa, Alexandru
    PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 2014, 8894 : 270 - 281
  • [45] On the parameterized vertex cover problem for graphs with perfect matching
    JianXin Wang
    WenJun Li
    ShaoHua Li
    JianEr Chen
    Science China Information Sciences, 2014, 57 : 1 - 12
  • [46] Parameterized algorithms for stable matching with ties and incomplete lists
    Adil, Deeksha
    Gupta, Sushmita
    Roy, Sanjukta
    Saurabh, Saket
    Zehavi, Meirav
    THEORETICAL COMPUTER SCIENCE, 2018, 723 : 1 - 10
  • [47] Simpler FM-index for parameterized string matching
    Kim, Sung-Hwan
    Cho, Hwan-Gue
    INFORMATION PROCESSING LETTERS, 2021, 165
  • [48] The parameterized complexity of the induced matching problem in planar graphs
    Moser, Hannes
    Sikdar, Somnath
    FRONTIERS IN ALGORITHMICS, PROCEEDINGS, 2007, 4613 : 325 - +
  • [49] Codes parameterized by the edges of a bipartite graph with a perfect matching
    Sarabia, Manuel Gonzalez
    Villarreal, Rafael H.
    ANALELE STIINTIFICE ALE UNIVERSITATII OVIDIUS CONSTANTA-SERIA MATEMATICA, 2023, 31 (02): : 85 - 100
  • [50] On the parameterized vertex cover problem for graphs with perfect matching
    Wang JianXin
    Li WenJun
    Li ShaoHua
    Chen JianEr
    SCIENCE CHINA-INFORMATION SCIENCES, 2014, 57 (07) : 1 - 12
12345