Fast parallel and serial multidimensional approximate array matching

DOI10.1016/0304-3975(91)90318-VMaRDI QIDQ2277849zbMATH OpenFDO

Authors Amihood Amir, Gad M. Landau

Publication date 1991

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(91)90318-V

zbMATH Keywords

close-match problemmismatches problemmulti-dimensional array matching

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Distributed algorithms (68W15)

Recommendations

• Publication:4206393
• Fast parallel and serial approximate string matching
• scientific article; zbMATH DE number 2185645
• scientific article; zbMATH DE number 710402
• String matching with weighted errors

Cites work

• A fast string searching algorithm
• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• An O(n log n) algorithm for finding all repetitions in a string
• Data structures and algorithms for approximate string matching
• Efficient randomized pattern-matching algorithms
• Efficient string matching
• Fast Algorithms for Finding Nearest Common Ancestors
• Fast parallel and serial approximate string matching
• Fast Pattern Matching in Strings
• Fast string matching with k differences
• scientific article; zbMATH DE number 3984596 (Why is no real title available?)
• scientific article; zbMATH DE number 3471577 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• Logarithmic Depth Circuits for Algebraic Functions
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• On the computational power of pushdown automata
• Optimal parallel algorithms for string matching
• Optimal parallel pattern matching in strings
• Parallel construction of a suffix tree with applications
• Parallel string matching with k mismatches
• Time-space-optimal string matching

Cited in

(13)

• Real two dimensional scaled matching
• Analysis of two-dimensional approximate pattern matching algorithms
• On two-dimensional pattern matching by optimal parallel algorithms
• Pattern matching in a digitized image
• Hardness of RNA folding problem with four symbols
• Two-dimensional pattern matching with rotations
• Generalized LCS
• Efficient one-dimensional real scaled matching
• scientific article; zbMATH DE number 2185645 (Why is no real title available?)
• scientific article; zbMATH DE number 4126689 (Why is no real title available?)
• THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW
• Faster two dimensional scaled matching
• Faster two-dimensional pattern matching with rotations

This page was built for publication: Fast parallel and serial multidimensional approximate array matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277849)