Login / Signup
Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier.
MohammadTaghi Hajiaghayi
Masoud Seddighin
Saeedreza Seddighin
Xiaorui Sun
Published in:
SIAM J. Comput. (2022)
Keyphrases
</>
longest common subsequence
worst case
approximation algorithms
dynamic time warping
edit distance
biological sequences
finite automata
similarity function
similarity measure
lower bound
np hard
upper bound
sequence matching
special case
shape similarity
subsequence matching
pairwise
computational complexity