搜索资源列表
fasta-35.3.6.tar
- 序列对齐 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
smith.rar
- 实现smith圆图显示和阻抗匹配，能够解决传输线阻抗匹配问题,The realization of smith chart display and impedance matching, transmission line impedance matching to solve the problem
dp_align.tar
- 双序列比对:全局比对或局部比对算法，针对蛋白质序列或核酸序列-This program will do Needle global or Smith-Waterman local alignment for two protein sequences or DNA sequences
smithcontrol
- 先进PID:Smith预估器纯滞后补偿，通过与PID控制器并接，来抵消实测滞后的影响-Advanced PID: Smith Predictor time delay compensation, with the PID controller and then to offset the impact of the measured hysteresis
smith
- smith圆图及阻抗匹配等相关应用，附有详细的代码-Smith Chart and impedance matching smith and other related applications, with detailed code
smith
- 1.本程序拟已知驻波比系数ρ，波节点的距离l_m_i_n，和频率f的情况下，求解归一化阻抗Z~， 所以在本程序运行时，要首先输入正确的驻波比系数ρ，波节点的距离l_m_i_n，和频率f； 2.本程序由于视野有限，课本后面的那个圆图并未全部显示出来，只是显示了本程序有用的部分 3.编制本程序的小组成员为微波技术实验分组，倪庆等； 4.由于时间原因，未能打成exe可执行文件包； 5.由于圆图信息量大，所以运行后要把窗口最大化才能正常显示； 6.红色的圆点即为阻抗
smith-waterman
- An Implementation of Smith Waterman Algorithm which compares two sequences and gives the common sequences along with the score
Russinov
- 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
ugene_1_7_0_win_x86
- 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
Smith-Waterman-algorithm
- smith waterman string matching algorithm
cudaswPPv2.0.7.tar
- 基于cuda的蛋白质搜索算法, Smith-Waterman protein database
sequence-alignment
- 基于动态规划算法的蛋白质序列比对 Needleman-Wunsch Smith-Waterman-protein sequence alignment Needleman-Wunsch Smith-Waterman
Needleman-Wunsch-and-Smith-Waterman
- 介绍动态编程之序列比对：Needleman-Wunsch 算法和Smith-Waterman算法-Sequence alignment of dynamic programming: needleman-wunsch gives you and Smith- Waterman algorithm
Smith-Waterman
- 使用Perl语言实现Smith-Waterman算法-Using Perl language Smith-Waterman algorithm
Sequence-alignment-scoring-matrix
- 序列比对中的smith-waterman算法，应用于局部序列比对，寻找最优化比对序列，精确度高-Smith- waterman in sequence alignment algorithm, is applied to the local sequence alignment, search for optimal matching sequence, high precision
Utilizing-MPJ-Express-Software-in-Parallel-DNA-Se
- 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
smith
- smith waterman算法实现，smith waterman算法实现smith waterman算法实现，-smith waterman
smithwaterman
- 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
S-Wg
- 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