The exact online string matching problem
From MaRDI portal
Publication:2875102
DOI10.1145/2431211.2431212zbMath1293.68314OpenAlexW1983788629MaRDI QIDQ2875102
Publication date: 13 August 2014
Published in: ACM Computing Surveys (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2431211.2431212
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithms on strings (68W32)
Related Items (26)
On-line string matching in highly similar DNA sequences ⋮ The Range Automaton: an efficient approach to text-searching ⋮ Weighted approximate parameterized string matching ⋮ On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees ⋮ A weak approach to suffix automata simulation for exact and approximate string matching ⋮ Fast and flexible packed string matching ⋮ Improved and self-tuned occurrence heuristics ⋮ Improved characters distance sampling for online and offline text searching ⋮ A Filtering Technique for All Pairs Approximate Parameterized String Matching ⋮ Efficient online string matching based on characters distance text sampling ⋮ Towards optimal packed string matching ⋮ Compact suffix automata representations for searching long patterns ⋮ Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition ⋮ An Accelerated Computational Approach in Proteomics ⋮ Optimal pattern matching algorithms ⋮ A faster quick search algorithm ⋮ Full-Text Indexes for High-Throughput Sequencing ⋮ Designing optimal- and fast-on-average pattern matching algorithms ⋮ Faster string matching based on hashing and bit-parallelism ⋮ Verifiable pattern matching on outsourced texts ⋮ Improved pattern-scan-order algorithms for string matching ⋮ Fast string matching for DNA sequences ⋮ Verifiable Pattern Matching on Outsourced Texts ⋮ A Very Fast String Matching Algorithm Based on Condensed Alphabets ⋮ Parallel String Matching ⋮ Efficient string matching based on a two-step simulation of the suffix automaton
This page was built for publication: The exact online string matching problem
