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 条
  • [31] Faster Approximate Pattern Matching: A Unified Approach
    Charalampopoulos, Panagiotis
    Kociumaka, Tomasz
    Wellnitz, Philip
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 978 - 989
  • [32] State Complexity of Neighbourhoods and Approximate Pattern Matching
    Ng, Timothy
    Rappaport, David
    Salomaa, Kai
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 389 - 400
  • [33] Reconfigurable approximate pattern matching architectures for nanotechnology
    Annampedu, Viswanath
    Wagh, Meghanad D.
    MICROELECTRONICS JOURNAL, 2007, 38 (03) : 430 - 438
  • [34] A linear size index for approximate pattern matching
    Chan, Ho-Leung
    Lam, Tak-Wah
    Sung, Wing-Kin
    Tam, Siu-Lung
    Wong, Swee-Seong
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2006, 4009 : 49 - 59
  • [35] Approximate pattern matching and transitive closure logics
    Lemström, K
    Hella, L
    THEORETICAL COMPUTER SCIENCE, 2003, 299 (1-3) : 387 - 412
  • [36] Efficient Algorithm for δ - Approximate Jumbled Pattern Matching
    Castellanos, Ivan
    Pinzon, Yoan
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2015, 2015, : 47 - 56
  • [37] NetDAP: (δ, γ) −approximate pattern matching with length constraints
    Youxi Wu
    Jinquan Fan
    Yan Li
    Lei Guo
    Xindong Wu
    Applied Intelligence, 2020, 50 : 4094 - 4116
  • [38] An Improved Pattern Matching Algorithm
    Yuan, Jingbo
    Zheng, Jisen
    Ding, Shunli
    2010 THIRD INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY AND SECURITY INFORMATICS (IITSI 2010), 2010, : 599 - 603
  • [39] String matching in hypertext
    Park, K
    Kim, DK
    COMBINATORIAL PATTERN MATCHING, 1995, 937 : 318 - 329
  • [40] Improved single and multiple approximate string matching
    Fredriksson, K
    Navarro, G
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2004, 3109 : 457 - 471
12345