Pages that link to "Item:Q5056115"
From MaRDI portal
The following pages link to Fast algorithms for two dimensional and multiple pattern matching (Q5056115):
Displaying 16 items.
- Two-dimensional pattern matching by sampling (Q685522) (← links)
- A simple fast hybrid pattern-matching algorithm (Q925062) (← links)
- Fast profile matching algorithms - A survey (Q932308) (← links)
- A faster algorithm for matching a set of patterns with variable length don't cares (Q991757) (← links)
- Analysis of two-dimensional approximate pattern matching algorithms (Q1129016) (← links)
- Average running time of the Boyer-Moore-Horspool algorithm (Q1190450) (← links)
- Fast two-dimensional pattern matching (Q1209318) (← links)
- Constant-space string-matching in sublinear average time (Q1292492) (← links)
- Fast practical multi-pattern matching (Q1606976) (← links)
- Dynamic and approximate pattern matching in 2D (Q1796841) (← links)
- Multiple matching of rectangular patterns (Q1891165) (← links)
- Fast string matching for multiple searches (Q2745228) (← links)
- Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms (Q4360129) (← links)
- Two-dimensional pattern matching in linear time and small space (Q4596620) (← links)
- Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time (Q4943755) (← links)
- On linear-time alphabet-independent 2-dimensional pattern matching (Q5096334) (← links)