An aggressive algorithm for multiple string matching

DOI10.1016/J.IPL.2009.01.022MaRDI QIDQ987821zbMATH OpenOpenAlexFDO

Authors Liuling Dai

Publication date 16 August 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2009.01.022

zbMATH Keywords

design of algorithmsstring matchingmultiple string matchingWu-Manber algorithm

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 1982175
• PAMA: A FAST STRING MATCHING ALGORITHM
• A memetic algorithm to schedule planned maintenance for the national grid
• A New String Matching Algorithm
• Faster string matching based on hashing and bit-parallelism

Cites work

• scientific article; zbMATH DE number 5725179 (Why is no real title available?)
• scientific article; zbMATH DE number 3633757 (Why is no real title available?)
• scientific article; zbMATH DE number 1982175 (Why is no real title available?)
• scientific article; zbMATH DE number 5204918 (Why is no real title available?)
• A fast string searching algorithm
• Efficient string matching
• Fast exact string matching algorithms
• Fast practical multi-pattern matching
• Some perils of performance prediction: A case study on pattern matching

Cited in

(4)

• Improved AC-BM algorithm for matching multiple strings
• The effect of multiple reference characters on detecting matches in string-searching algorithms
• An adaptive hybrid pattern-matching algorithm on indeterminate strings
• Multi-pattern matching algorithms and hardware based implementation

This page was built for publication: An aggressive algorithm for multiple string matching

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