Gonzalo Navarro  Home/Search
Context Related
| dcc.uchile.cl/~gnavarro/p...njc04.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcc.uchile.cl/~gnavarro/publ (more) Homepages: G.Navarro |
Rate this article:      (best)Comment on this article |
Abstract: We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/log_k s), where s is the amount of main memory that can be allocated. The algorithm permits arbitrary integer weights and matches the complexity of the best previous techniques, but it is simpler and faster in practice. In our way, we define a new recurrence for approximate searching where the current values depend only on previous values.... (Update)
Context of citations to this paper: More
...for the search. There exist some algorithms to handle regular expression searching allowing di erences under Levenshtein distance [34, 36, 24] (the latter indeed permits arbitrary integer weights) Albeit much faster than the algorithms for general edit distances, they are...
.... O(m) space, as shown by Myers and Miller [49] and in general in O(mn= log s) time using O(s) space, as shown by Wu et al. and Navarro [75, 53]. 17 4 Indexed Text Searching In this section we review the main techniques to maintain an index over the text, to speed up searches....
Cited by: More
Approximate Regular Expression Searching with Arbitrary Integer.. - Navarro (2003) (Correct)
Text Searching: Theory and Practice - Baeza-Yates, Navarro (Correct)
Fast and Simple Character Classes and Bounded Gaps Pattern.. - Navarro, Raffinot (2003) (Correct)
Active bibliography (related documents): More All
0.4: Pattern Matching - Navarro (Correct)
0.3: New Techniques for Regular Expression Searching - Navarro, Raffinot (Correct)
0.2: Regular Expression Searching on Compressed Text - Navarro (Correct)
Similar documents based on text: More All
0.4: IXPN: An Index-Based XPath Implementation - Navarro, Ortega (Correct)
0.4: Fast and Flexible String Matching by Combining.. - Navarro, Raffinot (2001) (Correct)
0.3: Regular Expression Searching over Ziv-Lempel Compressed Text - Navarro (2001) (Correct)
Related documents from co-citation: More All
4: Approximate Matching of Regular Expressions (context) - Myers, Miller - 1989
4: A four Russians algorithm for regular expression pattern matching (context) - Myers - 1992
4: A subquadratic algorithm for approximate regular expression matching (context) - Wu, Manber et al. - 1995
BibTeX entry: (Update)
G. Navarro. Approximate regular expression searching with arbitrary integer weights. Technical Report TR/DCC-2002-6, Dept. of Computer Science, University of Chile, July 2002. http://citeseer.ist.psu.edu/navarro03approximate.html More
@article{ navarro04approximate,
author = "G. Navarro",
title = "Approximate regular expression searching with arbitrary integer weights",
journal = "Nordic Journal of Computing",
year = "2004",
url = "citeseer.ist.psu.edu/navarro03approximate.html" }
Citations (may not include all citations):866 Techniques and Tools (context) - Aho, Sethi et al. - 1985
196 Fast text searching allowing errors (context) - Wu, Manber - 1992
148 The theory and computation of evolutionary distances: Patter.. (context) - Sellers - 1980
114 Finding approximate patterns in strings (context) - Ukkonen - 1985
86 A guided tour to approximate string matching - Navarro - 2001
85 Overview of the Third Text REtrieval Conference (context) - Harman - 1995
64 From regular expression to deterministic automata (context) - Berry, Sethi - 1986
61 Agrep -- a fast approximate pattern-matching tool - Wu, Manber - 1992
57 Regular expression search algorithm (context) - Thompson - 1968
45 Approximate matching of regular expressions (context) - Myers, Miller - 1989
29 Russian Mathematical Surveys (context) - Glushkov, theory - 1961
22 A four-russian algorithm for regular expression pattern matc.. (context) - Myers - 1992
13 Nr-grep: a fast and flexible pattern matching tool - Navarro - 2001
11 A subquadratic algorithm for approximate regular expression .. (context) - Wu, Manber et al. - 1995
8 Compact DFA representation for fast regular expression searc.. - Navarro, Ra - 2001
5 Vector algorithms for approximate string matching - Bergeron, Hamel - 2002
4 Approximate regular expression searching with arbitrary inte.. - Navarro - 2003
1 Personal communication with each (context) - Wu, Manber et al. - 2002
Documents on the same site (http://www.dcc.uchile.cl/~gnavarro/publ.html): More
A More Precise Solution to Two Problems on Tries - Navarro, Poblete (Correct)
Fast Approximate String Matching in a Dictionary - Baeza-Yates, Navarro (1998) (Correct)
An Optimal Index for PAT Arrays - Navarro (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC