Improved approximate pattern matching on hypertext

被引：31
|
作者：
Navarro, G [1 ]
机构：
[1] Univ Chile, Dept Comp Sci, Santiago, Chile
来源：
THEORETICAL COMPUTER SCIENCE | 2000年 / 237卷 / 1-2期
关键词：
approximate structure matching; graph algorithms;
D O I：
10.1016/S0304-3975(99)00333-3
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The problem of approximate pattern matching on hypertext is defined and solved by Amir et al. in O(m(n log In + e)) time, where IH is the length of the pattern, II is the total text size and e is the total number of edges. Their extra space complexity is O(mn). We present a new algorithm which is O(m(n + e)) time and needs only O(n) extra space. This improves all previous results in both time and space complexity. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
下载
收藏
页码：455 / 463
页数：9
相关论文
共 50 条
  • [41] Combinatorial and experimental methods for approximate point pattern matching
    Gavrilov, M
    Indyk, P
    Motwani, R
    Venkatasubramanian, S
    ALGORITHMICA, 2004, 38 (01) : 59 - 90
  • [42] Combinatorial and Experimental Methods for Approximate Point Pattern Matching
    Martin Gavrilov
    Piotr Indyk
    Rajeev Motwani
    Suresh Venkatasubramanian
    Algorithmica , 2004, 38 : 59 - 90
  • [43] Approximate geometric pattern matching under rigid motions
    Goodrich, MT
    Mitchell, JSB
    Orletsky, MW
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1999, 21 (04) : 371 - 379
  • [44] Approximate Circular Pattern Matching Under Edit Distance
    Charalampopoulos, Panagiotis
    Pissis, Solon P.
    Radoszewski, Jakub
    Rytter, Wojciech
    Walen, Tomasz
    Zuba, Wiktor
    41ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2024, 2024, 289
  • [45] Approximate VLDC pattern matching in shared-forest
    Vilares, M
    Ribadas, FJ
    Darriba, VM
    COMPUTATIONAL LINGUISTICS AND INTELLIGENT TEXT PROCESSING, 2001, 2004 : 483 - 494
  • [46] The Complexity of Approximate Pattern Matching on de Bruijn Graphs
    School of Computational Science and Engineering, Georgia Institute of Technology, Atlanta, United States
    不详
    Lect. Notes Comput. Sci., 1600, (263-278):
  • [47] On approximate pattern matching for a class of Gibbs random fields
    Chazottes, Jean-Rene
    Redig, Frank
    Verbitskiy, Evgeny
    ANNALS OF APPLIED PROBABILITY, 2006, 16 (02): : 670 - 684
  • [48] Efficient and secure outsourced approximate pattern matching protocol
    Wei, Xiaochao
    Zhao, Minghao
    Xu, Qiuliang
    SOFT COMPUTING, 2018, 22 (04) : 1175 - 1187
  • [49] Simulation-based Approximate Graph Pattern Matching
    Chen, Xiaoshuang
    SIGMOD'20: PROCEEDINGS OF THE 2020 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2020, : 2825 - 2827
  • [50] Source coding, large deviations, and approximate pattern matching
    Dembo, A
    Kontoyiannis, I
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (06) : 1590 - 1615
12345