Pages that link to "Item:Q1336956"
From MaRDI portal
The following pages link to Speeding up two string-matching algorithms (Q1336956):
Displaying 37 items.
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179) (← links)
- Fast and flexible packed string matching (Q405577) (← links)
- String matching with alphabet sampling (Q414445) (← links)
- Average complexity of backward \(q\)-gram string matching algorithms (Q436556) (← links)
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- Light-based string matching (Q835975) (← links)
- Accelerating Boyer-Moore searches on binary texts (Q840783) (← links)
- Efficient parameterized string matching (Q845838) (← links)
- A unifying look at the Apostolico--Giancarlo string-matching algorithm (Q876692) (← links)
- Practical and flexible pattern matching over Ziv-Lempel compressed text. (Q878012) (← links)
- A simple fast hybrid pattern-matching algorithm (Q925062) (← links)
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms (Q988198) (← links)
- Fast parameterized matching with \(q\)-grams (Q1018090) (← links)
- Constant-space string-matching in sublinear average time (Q1292492) (← links)
- Asymptotic estimation of the average number of terminal states in DAWGs (Q1304477) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- An algorithm to compute the character access count distribution for pattern matching algorithms (Q1736492) (← links)
- The wide window string matching algorithm (Q1770398) (← links)
- Average complexity of exact and approximate multiple string matching (Q1885904) (← links)
- Efficient online string matching based on characters distance text sampling (Q2205639) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Fast string matching for DNA sequences (Q2297856) (← links)
- Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata (Q2569397) (← links)
- Improved characters distance sampling for online and offline text searching (Q2682926) (← links)
- On-line string matching algorithms: survey and experimental results (Q2720122) (← links)
- NR‐grep: a fast and flexible pattern‐matching tool (Q2785069) (← links)
- A Very Fast String Matching Algorithm Based on Condensed Alphabets (Q2830059) (← links)
- Worst Case Efficient Single and Multiple String Matching in the RAM Model (Q3000497) (← links)
- (Q3143774) (← links)
- A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM (Q3421840) (← links)
- Accelerating Boyer Moore Searches on Binary Texts (Q3503901) (← links)
- EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM (Q3655531) (← links)
- A New String Matching Algorithm (Q4449514) (← links)
- Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition (Q4629542) (← links)
- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet (Q5321726) (← links)
- Fast Average-Case Pattern Matching on Weighted Sequences (Q5384623) (← links)
- THE DESIGN PRINCIPLES AND ALGORITHMS OF A WEIGHTED GRAMMAR LIBRARY (Q5462113) (← links)
