Two-dimensional dictionary matching
From MaRDI portal
Publication:1209347
DOI10.1016/0020-0190(92)90206-BzbMATH Open0796.68193OpenAlexW1989520229MaRDI QIDQ1209347FDOQ1209347
Authors: Amihood Amir, Martin Farach 
Publication date: 16 May 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(92)90206-b
Recommendations
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Computing methodologies for text processing; mathematical typography (68U15)
Cites Work
- Efficient string matching
- A fast string searching algorithm
- A Space-Economical Suffix Tree Construction Algorithm
- Fast Pattern Matching in Strings
- Fast Algorithms for Finding Nearest Common Ancestors
- Title not available (Why is that?)
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (27)
- Two-dimensional dynamic dictionary matching
- Two-dimensional pattern matching by sampling
- Dynamic dictionary matching with failure functions
- Generalizations of suffix arrays to multi-dimensional matrices.
- Finding maximal 2-dimensional palindromes
- Alphabet-Independent and Scaled Dictionary Matching
- Title not available (Why is that?)
- Succinct 2D dictionary matching
- Parallel construction and query of index data structures for pattern matching on square matrices
- Two-dimensional pattern matching with rotations
- On a conjecture on bidimensional words.
- A failure function for multiple two-dimensional pattern matching
- Indexing and querying color sets of images
- Approximation algorithms for maximum two-dimensional pattern matching
- Motif patterns in 2D
- Real two dimensional scaled matching
- Title not available (Why is that?)
- Succinct 2D dictionary matching with no slowdown
- Linear-time construction of two-dimensional suffix trees
- On-line construction of two-dimensional suffix trees
- Generalizations of suffix arrays to multi-dimensional matrices.
- A note on a tree-based 2D indexing
- 2D Lyndon words and applications
- Exact online two-dimensional pattern matching using multiple pattern matching algorithms
- Small-Space 2D Compressed Dictionary Matching
- TREE-BASED 2D INDEXING
- On Fine and Wilf's theorem for bidimensional words.
This page was built for publication: Two-dimensional dictionary matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209347)
