[理學(xué)]多序列比對-資料下載頁
2025-01-21 20:41本頁面
【正文】 erated that is used to derive a UPGMA tree Weights are subsequently applied to optimize the alignment. the sequences are randomly divided into two groups The two groups, each treated as a single sequence, are then aligned to each other using global dynamic programming. The process is repeated through many cycles until the total SP score no longer increases. At this point, the resulting alignment is used to construct a new UPGMA tree. New weights are applied to optimize alignment scores. 基 礎(chǔ) 生 物 信 息 學(xué) 及 應(yīng) 用 BlockBased Alignment ? The progressive and iterative alignment strategies are largely global alignment based and may therefore fail to recognize conserved domains and motifs among highly divergent sequences of varying lengths. For such divergent sequences that share only regional similarities, a local alignment based approach has to be used. 基 礎(chǔ) 生 物 信 息 學(xué) 及 應(yīng) 用 BlockBased Alignment ? DIALIGN2： ? a web based program ? It places emphasis on blocktoblock parison rather than residuetoresidue parison. The sequence regions between the blocks are left unaligned. ? The program has been shown to be especially suitable for aligning divergent sequences with only local similarity. 基 礎(chǔ) 生 物 信 息 學(xué) 及 應(yīng) 用 BlockBased Alignment ? MatchBox： ? webbased server ? Aims to identify conserved blocks (or boxes) among sequences. ? The server requires the user to submit a set of sequences in the FASTA format and the results are returned by . 基 礎(chǔ) 生 物 信 息 學(xué) 及 應(yīng) 用 ? 啟發(fā)式算法可以在合理的計算時間內(nèi)得到較優(yōu)的可行解。局域搜索啟發(fā)式算法應(yīng)用廣泛。局域搜索的一般步驟如下： ? 從一個初始可行解出發(fā) ? 找出相鄰的可行解 ? 從相鄰的可行解中找出更好的可行解 ? 一般地，局域搜索啟發(fā)式算法會得到一個局部最優(yōu)解，而這個局部最優(yōu)解有時就是全局最優(yōu)解。
教學(xué)課件相關(guān)推薦
鄂ICP備17016276號-1