scientific article; zbMATH DE number 3633757
From MaRDI portal
Publication:4194497
Cited in
(24)- Average-optimal string matching
- Fast two-dimensional pattern matching
- Dynamic dictionary matching with failure functions
- Dynamic dictionary matching
- On the string matching with \(k\) mismatches
- Regular expression searching on compressed text
- Fast and practical approximate string matching
- A new regular grammar pattern matching algorithm.
- A subquadratic algorithm for approximate limited expression matching
- Streaming dictionary matching with mismatches
- On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
- Fast algorithms for single and multiple pattern Cartesian tree matching
- Efficient dynamic dictionary matching with DAWGs and AC-automata
- Revisiting multiple pattern matching algorithms for multi-core architecture
- Towards optimal packed string matching
- The finite automata approaches in stringology
- Fast algorithms for two dimensional and multiple pattern matching
- Streaming Dictionary Matching with Mismatches
- Bouma2 -- a high-performance input-aware multiple string-match algorithm
- Shortest characteristic factors of a deterministic finite automaton and computing its positive position run by pattern set matching
- Compressed dictionary matching on run-length encoded strings
- Searching for a set of correlated patterns
- An aggressive algorithm for multiple string matching
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
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)
