当前位置：
首页 资源下载
搜索资源 - sequence alignment
搜索资源列表
-
0下载：
使用动态规划方法进行序列比对的模拟程序,用递归实现-The use of dynamic programming methods of sequence alignment of the simulation program
-
-
0下载：
基于关键字树的序列比对算法，用于比对多个相似程度很高的DNA序列，此为复杂度较低的星比对算法。-Keyword-based tree sequence alignment algorithm for more than a high degree of similarity of DNA sequences, this is the low complexity of the star alignment algorithm.
-
-
0下载：
blast是目前进行生物序列比对的经典软件，本书介绍了blast的基本原理。-Blast is present in biological sequence alignment of the classic software, this book introduces the basic principle of blast.
-
-
0下载：
A multiple sequence alignment program
-
-
0下载：
图形化多序列比对编辑器,能够读各种比对格式(MSF, CLUSTAL, FASTA, PHYLIP, MASE),可手动编辑队列。-Graphical multiple sequence alignment editor, able to read various alignment formats (MSF, CLUSTAL, FASTA, PHYLIP, MASE), you can manually edit the queue.
-
-
0下载：
This book provides the first unified, up-to-date, and tutorial-level overview of sequence
analysis methods, with particular emphasis on probabilistic modelling. Pairwise alignment,
hidden Markov models, multiple alignment, profile searches, RNA s
-
-
0下载：
MPI implementation of multiple sequence alignment.
-
-
1下载：
DNA sequence and animo acid sequence alignment using FASTA, BLAST.
-
-
0下载：
a seq algorithm, comparing string, string and sequence alignment
-
-
0下载：
OPT基因序列比對 也為字串比對是一個簡單比對string的範例-OPT gene sequence alignment for pattern matching is a simple example of string comparison
-
-
0下载：
求解序列比对得分矩阵，对于两个序列S和T，令[S]和[T]分别为序列S和T的长度，S[i]和T[j](其中正整数i，j满足0≤j< [S]和0≤j <[T])都属于字符集Ω={A,T,C,G,-},对Ω中的任何元素和空符号。
设计S[i]和T[j]两两之间的一个记分值来比较序列间的同一性的优劣,用记分函数σ(x，y)表示，
σ(S[i],T[j])=2 ( S[i]=T[j]≠-)；σ(S[i],T[j])= -1 ( S[i]≠T[j],S[i]≠-,T[j]≠-)；σ(S
-
-
0下载：
multipe sequence alignment in matlab
-
-
0下载：
本文详细介绍了目前通用的NCBI中blast生物序列比对软件的用法。-This paper introduces the current general NCBI blast biological sequence alignment software usage.
-
-
0下载：
动态编程，DNA 序列对比，最长公共子序列。一对DNA 序列可以手动输入，匹配参数，误配参数，和惩罚值可根据实验要求改变-Dynamic programming, DNA sequence comparison, the longest common subsequence. The DNA sequence can be entered manually, matching parameters mis-parameters, and the penalty value can be chan
-
-
0下载：
基于动态规划算法的蛋白质序列比对
Needleman-Wunsch
Smith-Waterman-protein sequence alignment
Needleman-Wunsch
Smith-Waterman
-
-
0下载：
多序列对齐，先用edit distance做打分矩阵，找到最相近的中心序列。然后用树状图做多序列对齐。-multiple sequence alignment， used edit distance and tree alignment。
-
-
0下载：
序列比对中的smith-waterman算法，应用于局部序列比对，寻找最优化比对序列，精确度高-Smith- waterman in sequence alignment algorithm, is applied to the local sequence alignment, search for optimal matching sequence, high precision
-
-
0下载：
分块递归序列比对算法，是一种基于动态规划思想的全局序列比对方法。
-Block recursive sequence alignment algorithm, it is a global sequence alignment dynamic programming based method.
-
-
1下载：
基因比对算法，Python，基于动态规划算法-Gene alignment algorithm, Python, based on dynamic programming algorithm
-
-
0下载：
字符串功能匹配问题，可以计算最小代价的字符串匹配(String function matching problem, you can calculate the minimum cost string matching)
-
