Two-dimensional dictionary matching

DOI10.1016/0020-0190(92)90206-BzbMath0796.68193MaRDI 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 matching; text processing; pattern matching algorithms

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W10: Parallel algorithms in computer science

68U15: Computing methodologies for text processing; mathematical typography

Related Items

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

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