Dynamic programming algorithms for picture comparison

DOI10.1016/0196-8858(85)90007-7zbMath0659.68110OpenAlexW2041188366MaRDI QIDQ1112625

Michael S. Waterman

Publication date: 1985

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-8858(85)90007-7

zbMATH Keywords

computational complexitydynamic programmingstring comparison

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Pattern recognition, speech recognition (68T10)

Cites Work

• Unnamed Item
• Matching rectangles in d-dimensions: Algorithms and laws of large numbers
• On the Theory and Computation of Evolutionary Distances
• Synchronization and substitution error-correcting codes for the Levenshtein metric
• Dynamic programming algorithm optimization for spoken word recognition
• The String-to-String Correction Problem
• Matching Sequences under Deletion/Insertion Constraints

This page was built for publication: Dynamic programming algorithms for picture comparison