Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[Feature] The Smith-Waterman Algorithm #1

Open
NicklasXYZ opened this issue Jul 23, 2023 · 1 comment
Open

[Feature] The Smith-Waterman Algorithm #1

NicklasXYZ opened this issue Jul 23, 2023 · 1 comment
Assignees
Labels
enhancement New feature or request

Comments

@NicklasXYZ
Copy link

The Smith-Waterman algorithm is essentially a paiwise sequence alignment algorithm typically used in bioinformatics to optimally align two (e.g. DNA) sequences.

The Smith-Waterman algorithm can be seen as a generalization of the edit distance and on the other hand the edit distance can be considered as a special case of the Smith-Waterman algorithm with specific scoring rules (giving specific weights to matching, mismatching string characters and gaps). There's more info here:

@giacomocavalieri
Copy link
Owner

Thank you for the suggestion! I'll look into it 💜

@giacomocavalieri giacomocavalieri self-assigned this Jul 28, 2023
@giacomocavalieri giacomocavalieri added the enhancement New feature or request label Jul 28, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

2 participants