Efficient comparison based string matching

DOI10.1006/jcom.1993.1022zbMath0783.68052OpenAlexW2086586680MaRDI QIDQ1311385

Zvi Galil, Dany Breslauer

Publication date: 23 January 1994

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1516

zbMATH Keywords

string matchingcomparisonsfamily of efficient algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Saving comparisons in the Crochemore-Perrin string-matching algorithm ⋮ How the character comparison order shapes the shift function of on-line pattern matching algorithms ⋮ Tight comparison bounds for the string prefix-matching problem

This page was built for publication: Efficient comparison based string matching