Smith–Waterman algorithm

The Smith–Waterman algorithm is a computer program that helps compare two sequences of DNA or proteins. It helps us answer the question, "How similar are these two sequences?" It does this by looking at all of the possible ways the two sequences could be arranged and line up. The best arrangement is the one that matches the most parts of both sequences to one another. It then gives us a score for how similar the two sequences are. This is useful for figuring out how closely related two things are.