Better indexing for rectangular pattern matching
From MaRDI portal
Cites work
- A Generalization of the Suffix Tree to Square Matrices, with Applications
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
- Alphabet-Independent Two-Dimensional Witness Computation
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- An index data structure for matrices, with applications to fast two-dimensional pattern matching
- Dynamic suffix tree and two-dimensional texts management
- scientific article; zbMATH DE number 3551946 (Why is no real title available?)
- scientific article; zbMATH DE number 1759461 (Why is no real title available?)
- Linear-time construction of two-dimensional suffix trees
- On the construction of classes of suffix trees for square matrices: algorithms and applications
- On-line construction of two-dimensional suffix trees
- On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
- Orthogonal range searching for text indexing
- Orthogonal range searching on the RAM, revisited
- Parallel construction and query of index data structures for pattern matching on square matrices
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Suffix Arrays: A New Method for On-Line String Searches
- Two-dimensional dictionary matching
This page was built for publication: Better indexing for rectangular pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322425)
