scientific article; zbMATH DE number 432780

MaRDI QIDQ3138910zbMATH OpenFDO

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

Publication date 20 September 1994

zbMATH Keywords

Boyer-Moore string searchingstring matching

Mathematics Subject Classification ID

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

Cited in

(8)

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

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)