An Alphabet Independent Approach to Two-Dimensional Pattern Matching
From MaRDI portal
Publication:4291559
DOI10.1137/S0097539792226321zbMath0804.68056MaRDI QIDQ4291559
Martin Farach, Amihood Amir, Gary Benson
Publication date: 10 May 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (33)
On a conjecture on bidimensional words. ⋮ Optimal parallel randomized renaming ⋮ Compressed matching for feature vectors ⋮ Parallel two dimensional witness computation ⋮ Lower bounds for the number of repetitions in 2D strings ⋮ Faster two dimensional scaled matching ⋮ Faster two-dimensional pattern matching with rotations ⋮ Succinct 2D dictionary matching ⋮ Analysis of two-dimensional approximate pattern matching algorithms ⋮ On linear-time alphabet-independent 2-dimensional pattern matching ⋮ Inplace run-length 2d compressed search. ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ Unnamed Item ⋮ Reconstructing parameterized strings from parameterized suffix and LCP arrays ⋮ Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton ⋮ Efficient string matching on packed texts ⋮ Searching for a set of correlated patterns ⋮ Towards a real time algorithm for parameterized longest common prefix computation ⋮ Optimal two-dimensional compressed matching ⋮ Fast parallel string prefix-matching ⋮ Generalized function matching ⋮ THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW ⋮ Networks of picture processors as problem solvers ⋮ 2D Lyndon words and applications ⋮ Approximation algorithms for maximum two-dimensional pattern matching ⋮ Parameterized matching on non-linear structures ⋮ Optimal parallel two dimensional text searching on a CREW PRAM ⋮ Complexity of Sets of Two-Dimensional Patterns ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ Optimal discovery of repetitions in 2D ⋮ Sequential and indexed two-dimensional combinatorial template matching allowing rotations ⋮ On Fine and Wilf's theorem for bidimensional words. ⋮ A multidimensional critical factorization theorem
This page was built for publication: An Alphabet Independent Approach to Two-Dimensional Pattern Matching
