| 1 | """ |
| 2 | https://en.wikipedia.org/wiki/Smith%E2%80%93Waterman_algorithm |
| 3 | The Smith-Waterman algorithm is a dynamic programming algorithm used for sequence |
| 4 | alignment. It is particularly useful for finding similarities between two sequences, |
nothing calls this directly
no test coverage detected