Is Levenshtein distance algorithm performs better than Needleman Wunsch Algorithm?

前端 未结 0 1060
忘掉有多难
忘掉有多难 2021-02-10 13:16

I know that both Levenshtein and Needleman Wunsch has the time complexity of O(N*M) but I was curious to know which one performs better than the other and why?

相关标签:
回答
  • 消灭零回复
提交回复
热议问题