May 20, 1999 Mireille R'egnier Wojciech Szpankowski Inria Department of...  Home/Search
Context
Related
| algo.inria.fr/papers/other...ReSz98a.ps 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: algo.inria.fr/papers/bi...algobib (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We formally define a class of sequential pattern matching algorithms that includes all variations of Morris-Pratt algorithm. For the last twenty years it was known that the complexity of such algorithms is bounded by a linear function of the text length. Recently, substantial progress has been made in identifying lower bounds. We now prove there exists asymptotically a linearity constant for the worst and the average cases. We use Subadditive Ergodic Theorem and prove an almost sure... (Update)
Similar documents (at the sentence level):
57.1%: Complexity of Sequential Pattern Matching Algorithms - Regnier, Szpankowski (Correct)
6.0%: Algorithms Seminar, 1995-1996 - Salvy (1996) (Correct)
Active bibliography (related documents): More All
0.5: On Boyer-Moore Automata - Baeza-Yates, Choffrut, al. (1994) (Correct)
0.5: On the Comparison Complexity of the String.. - Breslauer, Colussi.. (1995) (Correct)
0.3: Techniques of Average Case Analysis of Algorithms - Szpankowski (1998) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@article{ gnier98complexity,
author = "Mireille R{\'e}gnier and Wojciech Szpankowski",
title = "Complexity of Sequential Pattern Matching Algorithms",
journal = "Lecture Notes in Computer Science",
volume = "1518",
pages = "187--??",
year = "1998",
url = "citeseer.ist.psu.edu/755870.html" }
Citations (may not include all citations):602 Convergence of Probability Measures (context) - Billingsley - 1968
347 Fast Pattern Matching in Strings (context) - Knuth, Morris et al. - 1977
214 A fast String Searching Algorithm (context) - Boyer, Moore - 1977
196 Probability: Theory and Examples (context) - Durrett - 1991
30 The Boyer-Moore-Galil String Searching Strategies Revisited (context) - Apostolico, Giancarlo - 1986
19 The Height of Digital Trees and Related Problems (context) - Szpankowski - 1991
17 Average Size of Suffix Trees and DAWGS (context) - Blumer, Ehrenfeucht et al. - 1989
10 Tight Comparison Bounds for the String Prefix-Matching Probl.. - Breslauer, Colussi et al. - 1993
9 Tighter Lower Bounds on the Exact Complexity of String Match.. - Cole, Hariharan et al. - 1995
5 Analyse Exacte et en Moyenne d'Algorithmes de Recherche d'un.. (context) - Hancart - 1993
4 Subadditive Processes (context) - Kingman - 1975
4 eme Ergodique Presque Sous Additif (context) - Derriennic, Th'eor - 1983
4 A New Proof of the Linearity of the Boyer-Moore String Match.. (context) - Guibas, Odlyzko - 1980
4 Analysis of Boyer-Moore-Horspool String Matching Heuristic - Mahmoud, R'egnier et al. - 1996
4 Analysis of Suffix Tree by String-Ruler Approach (context) - Jacquet, Szpankowski et al. - 1994
3 First South-American Workshop on String Processing (context) - Simon, Algorithms - 1993
3 of String Matching, Proc. 31-st Annual IEEE Symposium on the.. (context) - Colussi, Galil et al. - 1990
2 Average Running Time of Boyer-Moore-Horspool Algorithm (context) - Baeza-Yates, R'egnier - 1992
1 Knuth-Morris-Pratt Algorithm: An Analysis (context) - R'egnier - 1989
Documents on the same site (http://algo.inria.fr/papers/bibgen/algobib.html): More
Complexity of Sequential Pattern Matching Algorithms - Regnier, Szpankowski (1999) (Correct)
A Unified Approach to Word Statistics - Regnier (1998) (Correct)
Mellin Transforms And Asymptotics: Finite Differences And.. - Flajolet, Sedgewick (1995) (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