Tuning the Zhu-Takaoka string matching algorithm and experimental results.

MaRDI QIDQ3143774zbMATH OpenFDO

Authors Somasundaram Ravindran, T. G. Berry

Publication date 4 December 2012

Full work available at URL http://www.kybernetika.cz/content/2002/1/67/paper.pdf

zbMATH Keywords

efficiencystring matching algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 1982175
• scientific article; zbMATH DE number 140461
• On-line string matching algorithms: survey and experimental results
• The effect of multiple reference characters on detecting matches in string-searching algorithms
• A New String Matching Algorithm

Cites work

• A comparison of three string matching algorithms
• A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
• A fast string searching algorithm
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 4045218 (Why is no real title available?)
• scientific article; zbMATH DE number 140461 (Why is no real title available?)
• Jewels of Stringology
• Speeding up two string-matching algorithms
• The Boyer–Moore–Galil String Searching Strategies Revisited
• Tight bounds on the complexity of the Apostolico-Giancarlo algorithm

Cited in

(1)

• The effect of multiple reference characters on detecting matches in string-searching algorithms

This page was built for publication: Tuning the Zhu-Takaoka string matching algorithm and experimental results.

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