An analytical comparison of two string searching algorithms

DOI10.1016/0020-0190(84)90003-6zbMATH Open0551.68055OpenAlexW2073493696MaRDI QIDQ800732FDOQ800732

Authors: Gerhard Barth 

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90003-6

Recommendations

• scientific article; zbMATH DE number 3976359
• scientific article; zbMATH DE number 17821
• scientific article; zbMATH DE number 1615293
• A fast string searching algorithm
• scientific article; zbMATH DE number 3943041

zbMATH Keywords

pattern matchingtext processinganalysis of combinatorial algorithmsaverage case time complexitysubstring searching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast Pattern Matching in Strings
• String overlaps, pattern matching, and nontransitive games
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (12)

• Average running time of the Boyer-Moore-Horspool algorithm
• Title not available (Why is that?)
• Optimal pattern matching algorithms
• Irredundant intervals
• String matching algorithms and automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• An analysis of the Karp-Rabin string matching algorithm
• Designing optimal- and fast-on-average pattern matching algorithms
• A fast string searching algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: An analytical comparison of two string searching algorithms

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