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