Two-dimensional dictionary matching

DOI10.1016/0020-0190(92)90206-BMaRDI QIDQ1209347zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• A failure function for multiple two-dimensional pattern matching
• scientific article; zbMATH DE number 1003305
• Succinct 2D dictionary matching
• Fast two-dimensional pattern matching
• Succinct 2D dictionary matching with no slowdown

Cites work

• scientific article; zbMATH DE number 432781 (Why is no real title available?)
• scientific article; zbMATH DE number 432822 (Why is no real title available?)
• scientific article; zbMATH DE number 3913713 (Why is no real title available?)
• A Space-Economical Suffix Tree Construction Algorithm
• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• A fast string searching algorithm
• Efficient string matching
• Fast Algorithms for Finding Nearest Common Ancestors
• Fast Pattern Matching in Strings

Cited in

(27)

• scientific article; zbMATH DE number 1786453 (Why is no real title available?)
• Linear-time construction of two-dimensional suffix trees
• On a conjecture on bidimensional words.
• TREE-BASED 2D INDEXING
• Succinct 2D dictionary matching
• On Fine and Wilf's theorem for bidimensional words.
• Generalizations of suffix arrays to multi-dimensional matrices.
• Alphabet-Independent and Scaled Dictionary Matching
• Exact online two-dimensional pattern matching using multiple pattern matching algorithms
• Motif patterns in 2D
• A failure function for multiple two-dimensional pattern matching
• Generalizations of suffix arrays to multi-dimensional matrices.
• Approximation algorithms for maximum two-dimensional pattern matching
• A note on a tree-based 2D indexing
• Two-dimensional pattern matching by sampling
• scientific article; zbMATH DE number 437564 (Why is no real title available?)
• Small-Space 2D Compressed Dictionary Matching
• Succinct 2D dictionary matching with no slowdown
• Two-dimensional dynamic dictionary matching
• Indexing and querying color sets of images
• Two-dimensional pattern matching with rotations
• Dynamic dictionary matching with failure functions
• Finding maximal 2-dimensional palindromes
• 2D Lyndon words and applications
• Real two dimensional scaled matching
• Parallel construction and query of index data structures for pattern matching on square matrices
• On-line construction of two-dimensional suffix trees

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)