Two-dimensional dictionary matching

DOI10.1016/0020-0190(92)90206-BzbMath0796.68193OpenAlexW1989520229MaRDI QIDQ1209347

Martin Farach, Amihood Amir

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

zbMATH Keywords

dictionary matchingtext processingpattern matching algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (17)

On a conjecture on bidimensional words. ⋮ Dynamic dictionary matching with failure functions ⋮ Two-dimensional pattern matching with rotations ⋮ Indexing and querying color sets of images ⋮ Succinct 2D dictionary matching ⋮ TREE-BASED 2D INDEXING ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ Linear-time construction of two-dimensional suffix trees ⋮ Finding maximal 2-dimensional palindromes ⋮ 2D Lyndon words and applications ⋮ Motif patterns in 2D ⋮ On-line construction of two-dimensional suffix trees ⋮ A Note on a Tree-Based 2D Indexing ⋮ Real two dimensional scaled matching ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ Parallel construction and query of index data structures for pattern matching on square matrices ⋮ On Fine and Wilf's theorem for bidimensional words.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast string searching algorithm
• Fast Algorithms for Finding Nearest Common Ancestors
• Efficient string matching
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings
• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension

This page was built for publication: Two-dimensional dictionary matching