scientific article; zbMATH DE number 1982175

MaRDI QIDQ4426344zbMATHFDO

Authors Domenico Cantone, Simone Faro

Publication date 16 September 2003

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

zbMATH Keywords

string matchingtext processingexperimental algorithms

Mathematics Subject Classification ID

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

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)

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

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 Q4426344)