Algorithm to find where exactly two strings match/differ [closed]

Question

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.

Closed 8 years ago.

I am working on finding the similarity/differences in the source code of different java programs. I've used an implementation of the Levenshtein algorithm to find how similar two programs are. I want to know if there is any algorithm that can help in finding the exact positions where two strings differ.

Answer 1

You will find more than you ever wanted to know by looking at the inner workings of diff - see for example this link or simply the wiki article