0

The output should be the similarity length, in this case 15(length)

enter image description here

Can anyone helps me?

Psidom
  • 209,562
  • 33
  • 339
  • 356
Ok alj
  • 11
  • 3
  • 1
    This isn't your homework, is it? Anyhow, the [Needleman–Wunsch algorithm] (https://en.m.wikipedia.org/wiki/Needleman–Wunsch_algorithm) may help here. – René Dec 25 '16 at 17:32
  • I suggest you read about the [LCS problem](https://en.wikipedia.org/wiki/Longest_common_subsequence_problem). [Here's](https://rosettacode.org/wiki/Longest_common_subsequence#Python) a site with some basic implementation of that algorithm. – Shachar Ohana Dec 25 '16 at 17:30

0 Answers0