Login / Signup

Polynomial-time equivalences and refined algorithms for longest common subsequence variants.

Yuichi AsahiroJesper JanssonGuohui LinEiji MiyanoHirotaka OnoTadatoshi Utashima
Published in: Discret. Appl. Math. (2024)
Keyphrases
  • longest common subsequence
  • computational complexity
  • worst case
  • special case
  • approximation algorithms
  • similarity measure
  • data structure
  • edit distance