A family of fast exact pattern matching algorithms

MaRDI QIDQ5271640zbMATH OpenFDO

Authors I. O. Zavadskï

Publication date 11 July 2017

Full work available at URL https://arxiv.org/abs/1608.08346

zbMATH Keywords

Boyer-Moorefast searchmulti-windowpattern matchingtext search

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Recommendations

• A simple fast hybrid pattern-matching algorithm
• Combinatorial Pattern Matching
• Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm
• Fastest Pattern Matching in Strings
• Fast two-dimensional pattern matching

Cited in

(6)

• A faster quick search algorithm
• Deterministic Sampling–A New Technique for Fast Pattern Matching
• Improvement of the search window shift calculation in MAWP search algorithms
• Fast pattern matching method for a bitstream
• A simple fast hybrid pattern-matching algorithm
• Fast profile matching algorithms - A survey

This page was built for publication: A family of fast exact pattern matching algorithms

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