Fast parallel and serial multidimensional approximate array matching
From MaRDI portal
Publication:2277849
DOI10.1016/0304-3975(91)90318-VzbMath0725.68050MaRDI QIDQ2277849
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (11)
On two-dimensional pattern matching by optimal parallel algorithms ⋮ Pattern matching in a digitized image ⋮ Two-dimensional pattern matching with rotations ⋮ Generalized LCS ⋮ Faster two dimensional scaled matching ⋮ Faster two-dimensional pattern matching with rotations ⋮ Analysis of two-dimensional approximate pattern matching algorithms ⋮ Hardness of RNA folding problem with four symbols ⋮ Efficient one-dimensional real scaled matching ⋮ THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW ⋮ Real two dimensional scaled matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel string matching with k mismatches
- Data structures and algorithms for approximate string matching
- Parallel construction of a suffix tree with applications
- Fast string matching with k differences
- Time-space-optimal string matching
- On the computational power of pushdown automata
- A fast string searching algorithm
- Fast Algorithms for Finding Nearest Common Ancestors
- An O(n log n) algorithm for finding all repetitions in a string
- Optimal parallel algorithms for string matching
- Optimal parallel pattern matching in strings
- Logarithmic Depth Circuits for Algebraic Functions
- Efficient randomized pattern-matching algorithms
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Efficient string matching
- Fast Pattern Matching in Strings
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
- Fast parallel and serial approximate string matching
This page was built for publication: Fast parallel and serial multidimensional approximate array matching
