1.2.1生物序列比对现状双序列比对(Pairwise Sequence Alignment)是指通过特定的算法对两个DNA或蛋白质序到进行比较,找出两者之阕最大楣儆性匹配。
基于36个网页-相关网页
On the research actuality of pairwise sequence alignment, several classic pairwise sequence alignment algorithm were analysized. These algorithms were programmed with C++ programme language and offered contrast experiment condition for the pairwise sequence alignment algorithm presented in this paper.3.
2．根据目前双序列比对的研究现状，对几种经典的双序列比对算法进行了分析介绍，并且用C++语言编程实现了这些算法，为本文研究的基于动态规划的双序列比对算法创造了对比实验条件。
参考来源 - 生物信息学中的序列比对算法研究Based on the research of these algorithms` design and the analysis of their performance, a pair-wise sequence alignment algorithm based on suffix tree is implemented.
在对这些算法的设计思想进行研究、性能进行比较分析的基础上,提出了基于后缀树的双序列比对算法SPLSA。
参考来源 - 生物序列比对算法的研究与实现·2,447,543篇论文数据，部分数据来源于NoteExpress
提出了一种基于马尔科夫随机场的双序列比对算法。
A novel markov pairwise protein sequence alignment method was proposed in this thesis.
本文将蚁群算法引入序列比对，并对基于蚁群算法的双序列比对和多序列比对进行了研究。
This thesis mainly focuses on the study of double sequence alignment and multiple sequence alignment based on ant colony algorithm.
在FPGA上实现大规模脉动式阵列对双序列比对算法进行加速能够大幅度提高比对的效率。
Implementing large scale of systolic array in FPGA to accelerate pare-wise alignment can improve the efficiency of alignment remarkably.
应用推荐