scientific article; zbMATH DE number 1982175

zbMATH Open1023.68874MaRDI QIDQ4426344FDOQ4426344

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

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

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

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)

Cited In (27)

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

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)