A New String Matching Algorithm

DOI10.1080/0020716031000087113MaRDI QIDQ4449514zbMATH OpenOpenAlexFDO

Authors Mustaq Ahmed, Mohammad Kaykobad, Rezaul Alam Chowdhury

Publication date 11 February 2004

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020716031000087113

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• Simple Optimal String Matching Algorithm
• Fast exact string matching algorithms
• scientific article; zbMATH DE number 1615293
• String-matching on ordered alphabets
• Publication:3468609

Cites work

• A fast string searching algorithm
• Correctness and efficiency of pattern matching algorithms
• Efficient randomized pattern-matching algorithms
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• On improving the worst case running time of the Boyer-Moore string matching algorithm
• On Simon's string searching algorithm
• On the Exact Complexity of String Matching: Upper Bounds
• Optimal canonization of all substrings of a string
• Speeding up two string-matching algorithms
• The Boyer–Moore–Galil String Searching Strategies Revisited
• Tight bounds on the complexity of the Apostolico-Giancarlo algorithm

Cited in

(29)

• String-matching on ordered alphabets
• Constant-space string-matching in sublinear average time
• Efficient comparison based string matching
• Faster algorithm of string comparison
• A family of fast constant-space substring search algorithms
• scientific article; zbMATH DE number 1615293 (Why is no real title available?)
• A very fast string matching algorithm based on condensed alphabets
• A fast suffix automata based algorithm for exact online string matching
• A fast string searching algorithm
• Tuning the Zhu-Takaoka string matching algorithm and experimental results.
• On String Matching in Chunked Texts
• New multi-pattern matching algorithm
• The Boyer–Moore–Galil String Searching Strategies Revisited
• scientific article; zbMATH DE number 4045218 (Why is no real title available?)
• An 0(1) time algorithm for string matching
• scientific article; zbMATH DE number 1982175 (Why is no real title available?)
• scientific article; zbMATH DE number 1484005 (Why is no real title available?)
• scientific article; zbMATH DE number 1555988 (Why is no real title available?)
• scientific article; zbMATH DE number 2092676 (Why is no real title available?)
• scientific article; zbMATH DE number 872102 (Why is no real title available?)
• A Boyer-Moore type string matching algorithm with memory and its computational complexity
• String Processing and Information Retrieval
• A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM
• A memetic algorithm to schedule planned maintenance for the national grid
• scientific article; zbMATH DE number 2247683 (Why is no real title available?)
• A seven-head dragon for optimal pattern searching
• Fast exact string matching algorithms
• A unifying look at the Apostolico--Giancarlo string-matching algorithm
• An aggressive algorithm for multiple string matching

This page was built for publication: A New String Matching Algorithm

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