scientific article; zbMATH DE number 432780

zbMATH Open0800.68474MaRDI QIDQ3138910FDOQ3138910

Authors: Gaston H. Gonnet, Mireille Régnier, Ricardo Baeza-Yates 

Publication date: 20 September 1994

Title of this publication is not available (Why is that?)

zbMATH Keywords

string matchingBoyer-Moore string searching

Mathematics Subject Classification ID

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

Cited In (8)

• Average running time of the Boyer-Moore-Horspool algorithm
• An algorithm to compute the character access count distribution for pattern matching algorithms
• The Boyer-Moore-Horspool heuristic with Markovian input
• Fast string matching for DNA sequences
• Improved pattern-scan-order algorithms for string matching
• On Boyer-Moore automata
• Average case analysis of the Boyer‐Moore algorithm
• Fast algorithms for two dimensional and multiple pattern matching

This page was built for publication:

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