Fast average-case pattern matching by multiplexing sparse tables
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 4119620 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- A fast string searching algorithm
- Efficient string matching
- Fast Pattern Matching in Strings
- Fast two-dimensional pattern matching
- Generalized String Matching
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- The Complexity of Pattern Matching for a Random String
Cited in
(3)
This page was built for publication: Fast average-case pattern matching by multiplexing sparse tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190461)