Some perils of performance prediction: A case study on pattern matching

DOI10.1002/SPE.392MaRDI QIDQ2745229zbMATH OpenOpenAlexFDO

Authors Peter Fenwick

Publication date 10 October 2001

Published in Software. Practice \& Experience (Search for Journal in Brave)

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

zbMATH Keywords

pattern matching algorithmsperformancestring searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99)

Recommendations

• On string pattern matching: A quantitative analysis and a proposal
• Algorithms for pattern matching
• Irredundant intervals
• The practical efficiency of convolutions in pattern matching algorithms
• scientific article; zbMATH DE number 2065613

Cites work

• Fast Pattern Matching in Strings
• Fast string matching for multiple searches
• scientific article; zbMATH DE number 828444 (Why is no real title available?)

Cited in

(6)

• Fast string matching for multiple searches
• On string pattern matching: A quantitative analysis and a proposal
• scientific article; zbMATH DE number 2065613 (Why is no real title available?)
• The practical efficiency of convolutions in pattern matching algorithms
• Identifying algorithmic vulnerabilities through simulated annealing
• An aggressive algorithm for multiple string matching

This page was built for publication: Some perils of performance prediction: A case study on pattern matching

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