Bio informatics course materials for NEUB students.
-
Updated
Oct 7, 2024 - C++
Bio informatics course materials for NEUB students.
Compute Global Maximum Similarity Matrix for 2 Sequences
一些算法实践Algorithmic practice
MSc Biology C++ Course Assignment. A program that can either perform a global, or local sequence alignment. Implementation of the Smith-Waterman and Needleman-Wunsch algorithms.
Add a description, image, and links to the needleman-wunsch-alignment topic page so that developers can more easily learn about it.
To associate your repository with the needleman-wunsch-alignment topic, visit your repo's landing page and select "manage topics."