On-line string matching algorithms: survey and experimental results

DOI10.1080/00207160108805036MaRDI QIDQ2720122zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

sequential string matching algorithms

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

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

Cites work

• scientific article; zbMATH DE number 42862 (Why is no real title available?)
• scientific article; zbMATH DE number 1142294 (Why is no real title available?)
• A comparison of three string matching algorithms
• A fast string searching algorithm
• A variation on the Boyer-Moore algorithm
• Algorithms for pattern matching
• Correctness and efficiency of pattern matching algorithms
• Fast Pattern Matching in Strings
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Fastest Pattern Matching in Strings
• On Simon's string searching algorithm
• On improving the worst case running time of the Boyer-Moore string matching algorithm
• Speeding up two string-matching algorithms
• The Boyer–Moore–Galil String Searching Strategies Revisited

Cited in

(15)

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

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)