搜索资源列表
dp_align.tar
- 双序列比对:全局比对或局部比对算法，针对蛋白质序列或核酸序列-This program will do Needle global or Smith-Waterman local alignment for two protein sequences or DNA sequences
cross-Entropy
- The cross-entropy (CE) method attributed to Reuven Rubinstein is a general Monte Carlo approach to combinatorial and continuous multi-extremal optimization and importance sampling. The method originated from the field of rare event simulation, where
code
- Needleman-Wunsch global alignment
genecompa
- 对两队序列的基因全局比对，最后输出了得分矩阵和比对结果。-a program for dynamic algorithm-based global alignment with C++ computer language
GlobalSequenceAlignment
- "全局序列比对问题的研究与实现"问题的c#实现-Global Sequence Alignment
needleman-wunsch
- needleman-wunsch全局/半全局序列比对算法的Java实现-needleman-wunsch global/semi-global sequence alignment algorithm java code to achieve complete
seq-alignment
- R语言实现的DNA序列全局序列比对 生物信息学概论作业1-global seq alignment
globalSeq
- 基于动态规划的全局序列比对程序，采用R语言编写，在生物信息领域应用非常广泛-Dynamic programming based on global sequence alignment program, using the R language, in a very wide field of application of bioinformatics
Block-recursive-alignment
- 分块递归序列比对算法，是一种基于动态规划思想的全局序列比对方法。 -Block recursive sequence alignment algorithm, it is a global sequence alignment dynamic programming based method.
Needle-Wunsch.c
- Needleman 和 Wunsch 提出的动态规划算法，这个算法是最早的最经典的双序列比对算法，就是针对寻求全局最佳序列比对这一问题所设计的动态规划寻优策略。(Needleman and Wunsch proposed a dynamic programming algorithm, this algorithm is the most classical algorithm of double sequence alignment of the earliest, is to seek th
捷联惯导及其组合导航研究
- 本文对捷联惯导系统(sINS)及其与全球定位系统(GPS)的组合导航系统进行 了研究。首先对实现S取S的初始对准及姿态矩阵计算等关键技术进行了系统研究。 在仿真的基础上进行了实际捷联惯导系统的系统研制，针对陀螺漂移补偿等关键算法 开展深入研究，实验结果表明经过补偿解算后，整个捷联惯导系统导航参数的解算精 度大大提高。在实现SINS的基础土，研究了SINS与GPS(The strapdown inertial navigation system (sINS) and global posi