Solving the multiple sequence alignment problem based on simulated annealing algorithm 多序列聯(lián)配問(wèn)題的模擬退火求解
So a good msa program tries to get a best balance between alignment quality and computation time 所以,那些取得對(duì)齊質(zhì)量與對(duì)齊時(shí)間最佳平衡的程序就是好的多序列對(duì)齊程序。
Among these tools , multiple sequence alignment ( msa ) is the most important because msa is central to most bioinformatics techniques 因?yàn)槠渌脑S多生信息學(xué)工具都是以多序列對(duì)齊為基礎(chǔ)的。
We have identified six conserved domains by multiple sequence alignments of the thymidine kinase proteins of the alphaherpesviruses 通過(guò)對(duì)皰疹病毒tk氨基酸進(jìn)行多序列比較,我們獲得了在prvtk氨基酸序列上的六個(gè)保守區(qū)間。
There are two land classification systems because of the using aim . one is land nature classification system or basis theory classification system 它包括兩種,一是從景觀學(xué)理論角度出發(fā),所建立的多序列分類系統(tǒng);二是單系列的分類系統(tǒng)。
Pairwise and multiple sequence alignment algorithms of bioinformaics are studied in this paper . the main contents and production can be briefly summarized as follows : 1 本文研究了生物信息學(xué)中的雙序列和多序列比對(duì)算法,主要研究?jī)?nèi)容和取得的成果如下: 1
2 . research of mining relationship patterns in multiple time series an algorithm for discovery frequent patterns in multiple time series will be proposed 2 )多時(shí)間序列間關(guān)聯(lián)模式挖掘研究針對(duì)更有分析價(jià)值的多序列關(guān)聯(lián)模式,進(jìn)一步提出一種新穎的關(guān)聯(lián)模式挖掘方法。
In this paper , we present a new alignment method ( lss - dca ) that combines the advantages of the dca method and progressive method , and that balances the speed and the quality better 在本文中,我們提出了一種新的多序列對(duì)齊算法lss - dca 。 lss - dca結(jié)合了dca方法和漸近方法的優(yōu)點(diǎn),達(dá)到了計(jì)算速度和對(duì)齊質(zhì)量的較好平衡。
Because the computational complexity of msa grows exponentially with the length of the sequences , and division can extremely reduce the computational complex and lead to fast alignment speed eventually 由于序列對(duì)齊的計(jì)算復(fù)雜性相對(duì)于序列長(zhǎng)度成指數(shù)形式增長(zhǎng),所以將長(zhǎng)序列集分割成短序列子集的dca思路可能產(chǎn)生快速的多序列對(duì)齊。
Firstly , this thesis studied sequence alignment algorithms in detail , such as needleman - wunch algorithm based on the dynamic programming ( dp algorithm ) , smith - waterman algorithm etc , and compared with their advantageous and disadvantageous 首先,論文詳細(xì)研究了序列比對(duì)方法,其中包括needleman等人的動(dòng)態(tài)規(guī)劃( dp )比對(duì)算法、 smith - waterman算法、以及部分多序列比對(duì)算法,并比較了各自的優(yōu)缺點(diǎn)。