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 条
  • [21] Strict approximate pattern matching with general gaps
    Wu, Youxi
    Fu, Shuai
    Jiang, He
    Wu, Xindong
    APPLIED INTELLIGENCE, 2015, 42 (03) : 566 - 580
  • [22] A black box for online approximate pattern matching
    Clifford, Raphael
    Efremenko, Klim
    Porat, Benny
    Porat, Ely
    INFORMATION AND COMPUTATION, 2011, 209 (04) : 731 - 736
  • [23] Strict approximate pattern matching with general gaps
    Youxi Wu
    Shuai Fu
    He Jiang
    Xindong Wu
    Applied Intelligence, 2015, 42 : 566 - 580
  • [24] A black box for online approximate pattern matching
    Clifford, Raphael
    Efremenko, Klim
    Porat, Benny
    Porat, Ely
    COMBINATORIAL PATTERN MATCHING, 2008, 5029 : 143 - +
  • [25] NetDAP: (δ, γ)-approximate pattern matching with length constraints
    Wu, Youxi
    Fan, Jinquan
    Li, Yan
    Guo, Lei
    Wu, Xindong
    APPLIED INTELLIGENCE, 2020, 50 (11) : 4094 - 4116
  • [26] State Complexity of Neighbourhoods and Approximate Pattern Matching
    Ng, Timothy
    Rappaport, David
    Salomaa, Kai
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2018, 29 (02) : 315 - 329
  • [27] An Efficient Algorithm for Approximate Pattern Matching with Swaps
    Campanelli, Matteo
    Cantone, Domenico
    Faro, Simone
    Giaquinta, Emanuele
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2009, 2009, : 90 - 104
  • [28] MULTIPLE FILTRATION AND APPROXIMATE PATTERN-MATCHING
    PEVZNER, PA
    WATERMAN, MS
    ALGORITHMICA, 1995, 13 (1-2) : 135 - 154
  • [29] Exact And Approximate Pattern Matching In The Streaming Model
    Porat, Benny
    Porat, Ely
    2009 50TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: FOCS 2009, PROCEEDINGS, 2009, : 315 - 323
  • [30] A linear size index for approximate pattern matching
    Chan, Ho-Leung
    Lam, Tak-Wah
    Sung, Wing-Kin
    Tama, Siu-Lung
    Wong, Swee-Seong
    JOURNAL OF DISCRETE ALGORITHMS, 2011, 9 (04) : 358 - 364
12345