Login / Signup

Solving longest common subsequence problems via a transformation to the maximum clique problem.

Christian BlumMarko DjukanovicAlberto SantiniHua JiangChu-Min LiFelip ManyàGünther R. Raidl
Published in: Comput. Oper. Res. (2021)
Keyphrases
  • longest common subsequence
  • combinatorial optimization
  • knowledge discovery
  • optimal solution
  • lower bound
  • support vector machine
  • natural language processing
  • dimensionality reduction