Edit distance for huge strings with bounds

cs.stackexchange https://cs.stackexchange.com/questions/95942

  •  05-11-2019
  •  | 
  •  

题

My question is simple but I don't know if the answer is.

If you have two strings of length 10 million each, is there an algorithm that would allow you in practice to compute their edit distance (Levenshtein) if you are told it is at most 100?

没有正确的解决方案

许可以下： CC-BY-SA 和 归因
不隶属于 cs.stackexchange
scroll top