Login / Signup
Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence.
MohammadTaghi Hajiaghayi
Saeed Seddighin
Xiaorui Sun
Published in:
SODA (2019)
Keyphrases
</>
massively parallel
longest common subsequence
approximation algorithms
edit distance
np hard
special case
worst case
parallel computing
minimum cost
distance measure
dynamic time warping
similarity measure
lower bounding
dynamic programming
distance function
nearest neighbor
similarity search
parallel machines