Needleman_Wunsch算法思路: 1.建立二维数组 2.建立评分模式 load1:向右:-2 load2:向下:-2 load3:对角线:依据是否配得到 匹配:+1 不匹配:-1 3.双层循环 如图:matrix_score:动态规划过程 过程如下图: 首先计算[2,2]的得分,并依据线路规则的到期与所有得分:依据线路方式选择arrow的记录(离散化?) 如图:matrix_arrow…

.txt kllk nciuwbufcbew``````//.]];s[[..; klklkl x,dsncdk,;l,ex xw,eocxmcmck .txt .txt kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk kllk nciuwbufcbew``````//.]];s[[..; klklkl x,dsncdk,;l,ex xw,eocxmcmck kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk ls .txt .txt.bak Need…