On-line string matching algorithms: survey and experimental results

DOI10.1080/00207160108805036zbMath0984.68134OpenAlexW2134820505MaRDI QIDQ2720122

Panagiotis D. Michailidis, Konstantinos G. Margaritis

Publication date: 14 May 2002

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

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

zbMATH Keywords

sequential string matching algorithms

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items

On-Line Approximate String Searching Algorithms: Survey and Experimental Results ⋮ A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM

Cites Work

• Unnamed Item
• Unnamed Item
• On Simon's string searching algorithm
• Correctness and efficiency of pattern matching algorithms
• A variation on the Boyer-Moore algorithm
• 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
• Algorithms for pattern matching
• A comparison of three string matching algorithms
• Fast Pattern Matching in Strings
• Fastest Pattern Matching in Strings
• Fast and flexible string matching by combining bit-parallelism and suffix automata