Login / Signup

A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint.

Daxin ZhuXiaodong Wang
Published in: Algorithms (2013)
Keyphrases
  • longest common subsequence
  • objective function
  • computational complexity
  • similarity measure
  • optimal solution
  • data structure
  • k means
  • dynamic programming
  • worst case
  • convex hull
  • object recognition