Can this be done in C language Thank you Problem 3 10 points

Can this be done in C language? Thank you

Problem 3 (10 points)

Implement the Needleman-Wunsch algorithm with m = 1, s = -1, d = -1. The input and output of your programs should be as follows.

Input: two sequence les. Each le contains one sequence, which can be recorded in multiple lines. Discard spaces if there is any.

Output: the optimal global alignment between the two sequences and the alignment score. The output alignment should have three lines as shown in the example below, where matching characters are shown by a — character, mismatches by a dot (.), and gaps by a dash (-). For longer sequences, break the alignment into lengths of 50.

Solution

Yes, this can be done in c language..

the optimal global algnment between the two sequences will b displaied.. along with the alignment score..