搜索资源列表
Needleman-Wunsch
- A c++ implementation of Needleman-Wunsch algorithm
likic
- Needleman - Wunsch Algorithm
NW
- Needleman-Wunsch algorithm Matlab.
DNA-sequences-matching-program
- 采用Needleman-Wunsch 算法,对两个相似的长序列进行比对. 文件中有2个DNA序列,通过插入空格使得这2个DNA序列等长且尽量的相似.对与插入空格后的2个等长序列,在相同的位置上如果两个字母相同则得1分,不同则得-1分,如果出现空格则得-2分.要求比对的结果得分最高.-use Needleman-Wunsch Algorithm compare and find the best match of two long similar sequences(like DNA)
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
Needleman-Wunsch
- 本文介绍基于最长公共子串的文本比较算法——Needleman/Wunsch算法。-In this paper, the text comparison algorithm based on the longest common substring Needleman/Wunsch algorithm
code
- Needleman-Wunsch global alignment
needleman-wunsch
- needleman-wunsch全局/半全局序列比对算法的Java实现-needleman-wunsch global/semi-global sequence alignment algorithm java code to achieve complete
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
Hollo-Bolt_3D_IGS_1074
- In this paper, an anisotropic formulation of the Gurson-Tvergaard-Needleman (GTN) damage model is used for simulating the deep-drawing of a rectangular box made from an AA6016-T4 metallic sheet. The model is implemented as a VUMAT routine in the ABAQ
基于GTN细观损伤模型的板料成形过程损伤分析
- 针对金属板料成形过程中的损伤破裂问题，基于Gurson-Tvergaard-Needleman(GTN)细观损伤本构模型建 立了相应的损伤力学有限元数值计算方法，将完全隐式应力更新算法与显式有限元计算相结合，并考虑了板料的 塑性各向异性行为，通过用户自定义材料子程序VUMAT将损伤模型嵌入到有限元软件ABAQUS中。