Login / Signup

Bounds on the Complexity of the Longest Common Subsequence Problem.

Alfred V. AhoDaniel S. HirschbergJeffrey D. Ullman
Published in: J. ACM (1976)
Keyphrases
  • beam search
  • worst case
  • upper bound
  • computational complexity
  • error bounds
  • lower and upper bounds
  • error tolerance
  • feature extraction
  • multi objective
  • optimization problems