Login / Signup

Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants.

Yuichi AsahiroJesper JanssonGuohui LinEiji MiyanoHirotaka OnoTadatoshi Utashima
Published in: CPM (2022)
Keyphrases
  • longest common subsequence
  • worst case
  • computational complexity
  • special case
  • biological sequences
  • data structure
  • optimal solution
  • object recognition