1. (25 points): Implement the Needleman-Wunsch algorithm (NWA.py or NWA.m) using fixed -3 for mismatches, 1 for a match, -2 for a gap. 2. (25 points): Implement another version of Needleman-Wunch algorithm (NWA_B62.py or NWA_B62.m) using BLOSUM62 scoring matrix and -5 for gap. The BLOSUM matrix is available for downloading at https://www.ncbi.nlm.nih.gov/Class/FieldGuide/BLOSUM62.txt (https://www.ncbi.nlm.nih.gov/Class/FieldGuide/BLOSUM62.txt)
Problems: 1. (25 points): Implement the Needleman-Wunsch algorithm (NWA.py or NWA.m) using fixed -3 for mismatches, 1 for a match, -2 for a gap. 2. (25 points): Implement another version of Needleman-Wunch algorithm (NWA_B62.py or NWA_B62.m) using BLOSUM62 scoring matrix and -5 for gap. The BLOSUM matrix is available for downloading at https://www.ncbi.nlm.nih.gov/Class/FieldGuide/BLOSUM62.txt (https://www.ncbi.nlm.nih.gov/Class/FieldGuide/BLOSUM62.txt) 3. (25 points) : Implement … Read more