Dynamic programming algorithms for picture comparison

DOI10.1016/0196-8858(85)90007-7MaRDI QIDQ1112625zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 1516705 (Why is no real title available?)
• Dynamic programming algorithm optimization for spoken word recognition
• Matching Sequences under Deletion/Insertion Constraints
• 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
• The String-to-String Correction Problem

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

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