Login / Signup

An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions.

Laurent BulteauMark JonesRolf NiedermeierTill Tantau
Published in: CPM (2022)
Keyphrases
  • maximum number
  • optimal solution
  • k means
  • computational complexity
  • np hard
  • worst case
  • objective function
  • object recognition
  • longest common subsequence