Login / Signup
An Improved Divide-and-Conquer Algorithm for Finding Top-k Longest Common Subsequence.
Wang Xuan
Ziyang Chen
Lusha Zhai
Published in:
NLPIR (2020)
Keyphrases
</>
matching algorithm
np hard
similarity measure
optimal solution
dynamic programming
worst case
longest common subsequence
computational complexity
pairwise
k means
shape descriptors