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

DOI10.1002/SPE.672MaRDI QIDQ5704752zbMATH OpenOpenAlexFDO

Authors Mahmoud M. Mhashi

Publication date 15 November 2005

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

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

zbMATH Keywords

checking and skippingcondition typemultiple referencespattern matchingstring-searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1982175
• A fast string searching algorithm
• Tuning the Zhu-Takaoka string matching algorithm and experimental results.
• An aggressive algorithm for multiple string matching
• scientific article; zbMATH DE number 3943041

Cites work

• Algorithms on Strings, Trees and Sequences
• scientific article; zbMATH DE number 1044854 (Why is no real title available?)

Cited in

(2)

• Single-pattern jumping algorithms
• Tuning the Zhu-Takaoka string matching algorithm and experimental results.

This page was built for publication: The effect of multiple reference characters on detecting matches in string-searching algorithms

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