当前位置：
首页 资源下载
搜索资源 - smith waterman algorithm
搜索资源列表
-
0下载：
序列对齐
Compare a protein sequence to a protein sequence
database or a DNA sequence to a DNA sequence database using the
Smith-Waterman algorithm.[.wat815.] \\fCssearch3\\fP is about 10-times
slower than FASTA3, but is more sensitive for full
-
-
0下载：
An Implementation of Smith Waterman Algorithm which compares two sequences and gives the common sequences along with the score
-
-
1下载：
Nussinov算法，预测rna二级结构-This program implements Nussinov algorithm on predicting RNA structure from RNA sequence using dynamic programming approach. The baisic idea is similiar with Smith-Waterman algorithm, obtaining optimal result about predicting RNA
-
-
0下载：
UGENE is a free cross-platform genome analysis suite.
Main features:
Multiple sequence alignment using MUSCLE 3,4 and KAlign
HMM profiles build and search, based on the source of HMMER 2 and HMMER 3
PCR Primers design using Primer 3
Pr
-
-
0下载：
smith waterman string matching algorithm
-
-
0下载：
介绍动态编程之序列比对：Needleman-Wunsch 算法和Smith-Waterman算法-Sequence alignment of dynamic programming: needleman-wunsch gives you and Smith- Waterman algorithm
-
-
0下载：
使用Perl语言实现Smith-Waterman算法-Using Perl language Smith-Waterman algorithm
-
-
0下载：
序列比对中的smith-waterman算法，应用于局部序列比对，寻找最优化比对序列，精确度高-Smith- waterman in sequence alignment algorithm, is applied to the local sequence alignment, search for optimal matching sequence, high precision
-
-
0下载：
DNA sequence alignment is the most
commonly application in computational biology. It is
essential pre-requisite of many other operations in
computational biology applications. Optimal alignment
for a large scale size DNA sequence dataset is a
-
-
0下载：
Smith-Waterman算法是Smith和Waterman提出的一种用来寻找并比较具有局部相似性区域的动态规划算法，很多后来的算法都是在该算法的基础上发展的。(Smith-Waterman algorithm is a dynamic programming algorithm proposed by Smith and Waterman to find and compare local similarity regions, and many subsequent algorithms
-
-
0下载：
Smith-Waterman算法是Smith和Waterman提出的一种用来寻找并比较具有局部相似性区域的动态规划算法，改进算法在其基础上可以输出所有最大分值的局部比对结果。(Smith-Waterman algorithm is a dynamic programming algorithm proposed by Smith and Waterman to find and compare local similarity regions, and many subsequent algor
-
