Login / Signup

-Approximation for Longest Common Subsequence.

Karl BringmannDebarati Das
Published in: ICALP (2021)
Keyphrases
  • longest common subsequence
  • approximation algorithms
  • dynamic time warping
  • edit distance
  • biological sequences
  • np hard
  • knowledge discovery
  • worst case
  • finite automata
  • lower bound
  • high dimensional
  • special case