On-line string matching algorithms: survey and experimental results

DOI10.1080/00207160108805036zbMATH Open0984.68134OpenAlexW2134820505MaRDI QIDQ2720122FDOQ2720122

Authors: 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

Recommendations

• On-Line Approximate String Searching Algorithms: Survey and Experimental Results
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Alternative algorithms for bit-parallel string matching.
• Tuning BNDM with \(q\)-grams
• Faster approximate string matching

zbMATH Keywords

sequential string matching algorithms

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cites Work

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

Cited In (15)

• On-line approximate string matching with bounded errors
• Tuning the Zhu-Takaoka string matching algorithm and experimental results.
• Shift-or string matching with super-alphabets
• A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM
• On String Matching in Chunked Texts
• On-line string matching in highly similar DNA sequences
• Tuning BNDM with \(q\)-grams
• Alternative algorithms for bit-parallel string matching.
• New method of curve modeling based on continuity for extension-Bézier curves
• ON IMPLEMENTATION AND PERFORMANCE OF TABLE-DRIVEN DFA-BASED STRING PROCESSORS
• The exact online string matching problem: a review of the most recent results
• On-Line Approximate String Searching Algorithms: Survey and Experimental Results
• An artificial neural network based approach for online string matching/filtering of large databases
• Title not available (Why is that?)
• Fast and flexible string matching by combining bit-parallelism and suffix automata

This page was built for publication: On-line string matching algorithms: survey and experimental results

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