Complexity of Sequential Pattern Matching Algorithms

@inproceedings{Rgnier1998ComplexityOS,
  title={Complexity of Sequential Pattern Matching Algorithms},
  author={Mireille R{\'e}gnier and Wojciech Szpankowski},
  booktitle={RANDOM},
  year={1998}
}
We formally define a class of sequential pattern matching algorithms that includes all variations of Morris-Pratt algorithm. For last twenty years it was known that complexity of such algorithms are bounded by a linear function of the text string length. Recenlly, substantial progress has been made in identifying lower bounds. However, it was not known whether really there exists asymptotically a linearity constant. We prove this fact rigorously for the worst case and the average case using… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 22 references

i Probability : Theory and Examples

View 8 Excerpts
Highly Influenced

Une Th eor eme Ergodique Presque Sous Additif, Ann

Y. Derriennic
Probab., 11, 669-677, • 1983
View 9 Excerpts
Highly Influenced

Subadditive Processes, in Ecole d'Et e de Probabilit es de Saint Flour V-1975

J.F.C. Kingman
Lecture Notes in Mathematics, • 1976
View 7 Excerpts
Highly Influenced

M

H. Mahmoud
R egnier and R. Smythe, Analysis of Boyer-Moore-Horspool String Matching Heuristic, in Random Structures and Algorithms, 10, 169{186, • 1996
View 1 Excerpt

andW

M. Crochemor
Rytter, Text Algorithms, Oxford University Press, New York • 1995

String Matching Algorithms and Automata

Results and Trends in Theoretical Computer Science • 1994
View 1 Excerpt

Analyse Exacte et en Moyenne d'Algorithmes de Recherche d'un Motif dans un Texte

C. Hancart
These, l'Universite Paris • 1993
View 1 Excerpt

Similar Papers

Loading similar papers…