A comparison of three string matching algorithms

DOI10.1002/SPE.4380120106zbMATH Open0466.68050OpenAlexW2080902012MaRDI QIDQ3919092FDOQ3919092

Authors: G. de V. Smit 

Publication date: 1982

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.4380120106

zbMATH Keywords

pattern matchingtime complexitysearching

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cited In (7)

• Fast string matching in stationary ergodic sources
• Fast string matching for multiple searches
• Tuning the Zhu-Takaoka string matching algorithm and experimental results.
• On-line string matching algorithms: survey and experimental results
• On-Line Approximate String Searching Algorithms: Survey and Experimental Results
• Automatic error correction in flexion languages
• How the character comparison order shapes the shift function of on-line pattern matching algorithms

This page was built for publication: A comparison of three string matching algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3919092)