Skip to content

xariskap/Bioinformatics

Repository files navigation

Bioinformatics university project

global_align.py is the Needleman-Wunsch algorithm

local_align.py is the Smith–Waterman algorithm

ex4_2.py solves the following problem in Θ(k*n): Given two strings with size n, find all the corresponding character matches of all possible k-length substrings.

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages