Cyril Allauzen, Maxime Crochemore, Mathieu Ranot  Home/Search
Context
Related
| igm.univmlv.fr/~r...entcpm2001.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: igm.univmlv.fr/~raffino...oracle (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce a new notion of weak factor recognition that is the foundation of new data structures and on-line string matching algorithms. (Update)
Similar documents (at the sentence level):
23.1%: Factor oracle, Suffix oracle - Allauzen, Crochemore, Raffinot (1999) (Correct)
14.4%: Factor oracle, Suffix oracle (Extended Abstract) - Allauzen, Crochemore, Raffinot (Correct)
12.3%: Factor Oracle: A New Structure for Pattern Matching - Allauzen, Crochemore, Raffinot (1999) (Correct)
Active bibliography (related documents): More All
0.5: Text Searching: Theory and Practice - Baeza-Yates, Navarro (Correct)
0.2: New Experimental Results on Exact String-Matching - Lecroq (Correct)
0.1: Reducing Space for Index Implementation - Crochemore (Correct)
Similar documents based on text: More All
0.6: On Maximal Repeats in Strings - Raffinot (Correct)
0.6: Fast and Simple Character Classes and Bounded Gaps Pattern.. - Navarro, Raffinot (2001) (Correct)
0.5: Fast and simple character classes and bounded gaps pattern.. - Navarro, Raffinot (2001) (Correct)
BibTeX entry: (Update)
@article{ allauzen01efficient,
author = "Cyril Allauzen and Maxime Crochemore and Mathieu Raffinot",
title = "Efficient Experimental String Matching by Weak Factor Recognition",
journal = "Lecture Notes in Computer Science",
volume = "2089",
pages = "51--??",
year = "2001",
url = "citeseer.ist.psu.edu/498570.html" }
Citations (may not include all citations):214 A fast string searching algorithm (context) - Boyer, Moore - 1977
204 Oxford University Press (context) - Crochemore, Rytter - 1994
59 Speeding up two string-matching algorithms (context) - Czumaj, Crochemore et al. - 1994
56 A very fast substring search algorithm (context) - Sunday - 1990
55 The smallest automaton recognizing the subwords of a text (context) - Blumer, Blumer et al. - 1985
29 The complexity of pattern matching for a random string (context) - Yao - 1979
28 Transducers and repetitions (context) - Crochemore - 1986
13 Factor oracle: a new structure for pattern matching - Allauzen, Crochemore et al.
8 Searching subsequences (context) - Baeza-Yates - 1991
2 Factor oracle of a set of words (context) - Allauzen, Ranot - 1999
1 Combinatoire sur les mots et recherche de motifs (context) - Allauzen - 2001
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