scientific article; zbMATH DE number 3633757
From MaRDI portal
Publication:4194497
Cited in
(22)- Bouma2 -- a high-performance input-aware multiple string-match algorithm
- Revisiting multiple pattern matching algorithms for multi-core architecture
- Fast algorithms for single and multiple pattern Cartesian tree matching
- Fast and practical approximate string matching
- A subquadratic algorithm for approximate limited expression matching
- Efficient dynamic dictionary matching with DAWGs and AC-automata
- Fast two-dimensional pattern matching
- Streaming dictionary matching with mismatches
- A new regular grammar pattern matching algorithm.
- An aggressive algorithm for multiple string matching
- Dynamic dictionary matching
- Fast algorithms for two dimensional and multiple pattern matching
- Average-optimal string matching
- On the string matching with \(k\) mismatches
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
- The finite automata approaches in stringology
- Streaming Dictionary Matching with Mismatches
- Regular expression searching on compressed text
- Towards optimal packed string matching
- On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
- Dynamic dictionary matching with failure functions
- Searching for a set of correlated patterns
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4194497)
