jsDNA動態(tài)序列比對代碼_javascript技巧

來源：懂視網(wǎng) 責(zé)編：小采時間：2020-11-27 20:53:54

jsDNA動態(tài)序列比對代碼_javascript技巧

jsDNA動態(tài)序列比對代碼_javascript技巧: 動態(tài)序列比對 function pairaln(seq1, seq2){ // scoring scheme var MATCH = 1; // +1 for letters that match var MISMATCH = -1; // -1 for letters that mismatch var GAP = -1; // -1 for a

推薦度：

點擊下載本文 文檔為doc格式

導(dǎo)讀jsDNA動態(tài)序列比對代碼_javascript技巧: 動態(tài)序列比對 function pairaln(seq1, seq2){ // scoring scheme var MATCH = 1; // +1 for letters that match var MISMATCH = -1; // -1 for letters that mismatch var GAP = -1; // -1 for a

<title>動態(tài)序列比對</title> 
<script> 
function pairaln(seq1, seq2){ 
// scoring scheme

var MATCH = 1; // +1 for letters that match 
var MISMATCH = -1; // -1 for letters that mismatch 
var GAP = -1; // -1 for any gap 
// initialization

var score=[[]]; 
var pointer=[[]]; 
score[0][0] = 0; 
pointer[0][0] = 0; 
var l1=seq1.length 
var l2=seq2.length

for(var j = 1; j <= l1; j++) {

score[0][j] = GAP * j; 
pointer[0][j] = 2; 
} 
for (var i = 1; i <= l2; i++) {

score[i]=[]; 
pointer[i]=[]; 
score[i][0] = GAP * i; 
pointer[i][0] = 3; 
} 
// fill

for(var i = 1; i <= l2; i++) { 
var letter2 = seq2.charAt(i-1);

for(var j = 1; j <= l1; j++) {

var diagonal_score, left_score, up_score; 
// calculate match score

var letter1 = seq1.charAt(j-1);

if (letter1 == letter2) {

diagonal_score = score[i-1][j-1] + MATCH; 
}

else { 
diagonal_score = score[i-1][j-1] + MISMATCH; 
} 
// calculate gap scores

up_score = score[i-1][j] + GAP; 
left_score = score[i][j-1] + GAP; 
// choose best score

if (diagonal_score >= up_score) {

if (diagonal_score >= left_score) {

score[i][j] = diagonal_score; 
pointer[i][j] = 1; 
}

else { 
score[i][j] = left_score; 
pointer[i][j] = 2; 
}

} else {

if (up_score >= left_score) {

score[i][j] = up_score; 
pointer[i][j] = 3; 
}

else { 
score[i][j] = left_score; 
pointer[i][j] = 2; 
} 
} 
} 
} 
// trace-back

var align1 = []; 
var align2 = []; 
// start at last cell of matrix 
var j = l1; 
var i = l2; 
while (1) {

if(pointer[i][j] == 0)break // ends at first cell of matrix 
if (pointer[i][j] == 1) {

align1[align1.length] = seq1.charAt(j-1); 
align2[align2.length] = seq2.charAt(i-1); 
i--; 
j--; 
}

if (pointer[i][j] == 2) {

align1[align1.length] = seq1.charAt(j-1); 
align2[align2.length] = "-"; 
j--; 
}

if (pointer[i][j] == 3) {

align1[align1.length] = "-"; 
align2[align2.length] = seq2.charAt(i-1); 
i--; 
} 
} 
align1 = align1.reverse(); 
align2 = align2.reverse(); 
return "序列：<p>"+seq1+"<br>"+seq2+"<p>比對結(jié)果：<table><tr><td>"+align1.join("</td><td>")+"</td></tr><tr><td>"+align2.join("</td><td>")+"</tr></table>" 
} 
document.write(pairaln('CTGGGCTGACTGA', 'GACTAGCTAGACTGA')) 
</ script>

[Ctrl+A 全選注:如需引入外部Js需刷新才能執(zhí)行]

聲明：本網(wǎng)頁內(nèi)容旨在傳播知識，若有侵權(quán)等問題請及時與本網(wǎng)聯(lián)系，我們將在第一時間刪除處理。TEL:177 7030 7066 E-MAIL:11247931@qq.com

jsDNA動態(tài)序列比對代碼_javascript技巧

推薦度：

點擊下載本文 文檔為doc格式

標(biāo)簽：動態(tài) DNA js

熱門焦點

做爰高潮a片〈毛片〉,尤物av天堂一区二区在线观看,一本久久A久久精品VR综合,添女人荫蒂全部过程av

jsDNA動態(tài)序列比對代碼_javascript技巧

jsDNA動態(tài)序列比對代碼_javascript技巧

jsDNA動態(tài)序列比對代碼_javascript技巧

最新推薦

猜你喜歡

熱門推薦