Pages that link to "Item:Q1183611"
From MaRDI portal
The following pages link to Correctness and efficiency of pattern matching algorithms (Q1183611):
Displaying 18 items.
- How the character comparison order shapes the shift function of on-line pattern matching algorithms (Q671355) (← links)
- Tight comparison bounds for the string prefix-matching problem (Q685487) (← links)
- Light-based string matching (Q835975) (← links)
- A fast pattern matching algorithm derived by transformational and assertional reasoning (Q911750) (← links)
- A simple fast hybrid pattern-matching algorithm (Q925062) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- Improved pattern-scan-order algorithms for string matching (Q1784983) (← links)
- Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm (Q1853605) (← links)
- Fast string matching for DNA sequences (Q2297856) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
- On-line string matching algorithms: survey and experimental results (Q2720122) (← links)
- An artificial neural network based approach for online string matching/filtering of large databases (Q3563649) (← links)
- Algorithms for pattern matching (Q3721828) (← links)
- Fastest Pattern Matching in Strings (Q4285908) (← links)
- A New String Matching Algorithm (Q4449514) (← links)
- Functional and Logic Programming (Q5308027) (← links)
- Combinatorial Pattern Matching (Q5713551) (← links)
- (Q6079229) (← links)