Notes on Approximate Matching

• Time complexity O(mn)

• Storage complexity O(mn)

  • Storage in the dynamic program can be reduced to O(m+n) by just keeping the frontier.
  • Recovering the matching can be done in time O(m+n) cleverly.

Previous slide

Back to first slide

View graphic version