Login / Signup

A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence.

Thierry LecroqGuillaume LuceJean Frédéric Myoupo
Published in: Inf. Process. Lett. (1997)
Keyphrases
  • optimal solution
  • k means
  • longest common subsequence
  • similarity measure
  • matching algorithm
  • objective function
  • machine learning
  • np hard
  • feature selection
  • dynamic programming
  • nearest neighbor
  • worst case