Fast-Search: A new efficient variant of the Boyer-Moore string matching algorithm

DOI10.1007/3-540-44867-5_4MaRDI QIDQ4426344zbMATH OpenFDO

Authors Domenico Cantone, Simone Faro

Publication date 16 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2647/26470047.htm

zbMATH Keywords

experimental algorithmsstring matchingtext processing

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies for text processing; mathematical typography (68U15) Nonnumerical algorithms (68W05)

Recommendations

• Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm
• A memetic algorithm to schedule planned maintenance for the national grid
• Fastest Pattern Matching in Strings
• scientific article; zbMATH DE number 4045218
• A New String Matching Algorithm

Cited in

(27)

• Faster algorithm of string comparison
• Improved pattern-scan-order algorithms for string matching
• Approximate Boyer-Moore string matching for small alphabets
• A family of fast constant-space substring search algorithms
• Faster algorithm for single pattern matching
• A very fast string matching algorithm based on condensed alphabets
• Single-pattern jumping algorithms
• Tuning the Zhu-Takaoka string matching algorithm and experimental results.
• Accelerating Boyer Moore Searches on Binary Texts
• Improved AC-BM algorithm for matching multiple strings
• Efficient variants of the backward-oracle-matching algorithm
• An adaptive hybrid pattern-matching algorithm on indeterminate strings
• The Boyer–Moore–Galil String Searching Strategies Revisited
• Fast and flexible packed string matching
• Improved and self-tuned occurrence heuristics
• A new regular grammar pattern matching algorithm
• Linear and efficient string matching algorithms based on weak factor recognition
• Boyer-Moore approach to approximate string matching
• Faster string matching based on hashing and bit-parallelism
• PAMA: A FAST STRING MATCHING ALGORITHM
• Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm
• A memetic algorithm to schedule planned maintenance for the national grid
• The effect of multiple reference characters on detecting matches in string-searching algorithms
• Accelerating Boyer-Moore searches on binary texts
• Fast exact string matching algorithms
• A fast pattern matching algorithm derived by transformational and assertional reasoning
• An aggressive algorithm for multiple string matching

This page was built for publication: Fast-Search: A new efficient variant of the Boyer-Moore string matching algorithm

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