Faster pattern matching with character classes using prime number encoding
DOI10.1016/J.JCSS.2008.08.005zbMATH Open1169.68044OpenAlexW2020266312MaRDI QIDQ1004281FDOQ1004281
Authors: Chaim Linhart, Ron Shamir 
Publication date: 2 March 2009
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2008.08.005
Recommendations
Pattern recognition, speech recognition (68T10) Analysis of algorithms (68W40) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Approximation algorithms (68W25)
Cites Work
- Introduction to algorithms
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- PRIMES is in P
- Approximate formulas for some functions of prime numbers
- A fast string searching algorithm
- Fast Pattern Matching in Strings
- Title not available (Why is that?)
- Verifying candidate matches in sparse and wildcard matching
- Title not available (Why is that?)
- Generalized String Matching
- Simple deterministic wildcard matching
- Title not available (Why is that?)
- Prime sieves using binary quadratic forms
- The p53MH algorithm and its application in detecting p53-responsive genes
Cited In (8)
- Space lower bounds for online pattern matching
- Modulated string searching
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
- An acceleration of FFT-based algorithms for the match-count problem
- Pattern matching with wildcards using words of shorter length
- Fast convolutions of packed strings and pattern matching with wildcards
- Multi-pattern matching algorithm with wildcards based on bit-parallelism
- Space Lower Bounds for Online Pattern Matching
This page was built for publication: Faster pattern matching with character classes using prime number encoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004281)
