A New String Matching Algorithm

DOI10.1080/0020716031000087113zbMath1089.68662OpenAlexW1969804148MaRDI QIDQ4449514

Mohammad Kaykobad, Mustaq Ahmed, 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

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

Cites Work

• Unnamed Item
• Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
• On Simon's string searching algorithm
• Optimal canonization of all substrings of a string
• Correctness and efficiency of pattern matching algorithms
• Speeding up two string-matching algorithms
• On improving the worst case running time of the Boyer-Moore string matching algorithm
• A fast string searching algorithm
• The Boyer–Moore–Galil String Searching Strategies Revisited
• Efficient randomized pattern-matching algorithms
• On the Exact Complexity of String Matching: Upper Bounds
• Fast Pattern Matching in Strings