Description: 序列比对程式，主要一开始输入两串DNA序列，然后设置MATCH的值，最后算出分数-sequence alignment program, began to import store a DNA sequence, then set up MATCH value, calculate the final score Platform: |
Size: 1024 |
Author:林建达 |
Hits:
Description: 多重序列比对源代码，即所谓的clustral算法。采用两两比对的思想-Multiple sequence alignment of the source code, the so-called clustral algorithm. The use of more than 22 of the ideological Platform: |
Size: 783360 |
Author:xiaoxiao |
Hits:
Description: 序列图像配准程序，对有偏移和旋转的序列图像进行配准，以便下一步的超分辩率重建处理-Sequence of image registration procedures, has offset and rotating images in sequence alignment, the next step in order to deal with super-resolution reconstruction Platform: |
Size: 265216 |
Author:侯天峰 |
Hits:
Description: 序列对齐
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-length protein
sequence comparison.-Alignment Compare a protein sequence to a protein sequence database or a DNA sequence to a DNA sequence database using the Smith-Waterman algorithm. [. Wat815.] Cssearch3 P is about 10-times slower than FASTA3, but is more sensitive for full-length protein sequence comparison. Platform: |
Size: 614400 |
Author:Galaxy |
Hits:
Description: 使用动态规划方法进行序列比对的模拟程序,用递归实现-The use of dynamic programming methods of sequence alignment of the simulation program Platform: |
Size: 1024 |
Author:blch |
Hits:
Description: SVMstruct is a Support Vector Machine (SVM) algorithm for predicting multivariate or structured outputs. It performs supervised learning by approximating a mapping
h: X --> Y
using labeled training examples (x1,y1), ..., (xn,yn). Unlike regular SVMs, however, which consider only univariate predictions like in classification and regression, SVMstruct can predict complex objects y like trees, sequences, or sets. Examples of problems with complex outputs are natural language parsing, sequence alignment in protein homology detection, and markov models for part-of-speech tagging. The SVMstruct algorithm can also be used for linear-time training of binary and multi-class SVMs under the linear kernel.
-SVMstruct is a Support Vector Machine (SVM) algorithm for predicting multivariate or structured outputs. It performs supervised learning by approximating a mapping
h: X--> Y
using labeled training examples (x1,y1), ..., (xn,yn). Unlike regular SVMs, however, which consider only univariate predictions like in classification and regression, SVMstruct can predict complex objects y like trees, sequences, or sets. Examples of problems with complex outputs are natural language parsing, sequence alignment in protein homology detection, and markov models for part-of-speech tagging. The SVMstruct algorithm can also be used for linear-time training of binary and multi-class SVMs under the linear kernel.
Platform: |
Size: 109568 |
Author:jon |
Hits:
Description: 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 secondary structure
analysis, and phylogenetic inference are treated at length. Platform: |
Size: 3951616 |
Author:Dang Tran Vu |
Hits:
Description: OPT基因序列比對 也為字串比對是一個簡單比對string的範例-OPT gene sequence alignment for pattern matching is a simple example of string comparison Platform: |
Size: 330752 |
Author:dennis |
Hits:
Description: 求解序列比对得分矩阵，对于两个序列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[i],T[j])= -2 (S[i]orT[j]=-)。-Solve the sequence alignment score matrix for two sequences S and T, so [S] and [T] S and T respectively, sequence length, S [i] and T [j] (which is an integer i, j satisfying 0 ≤ j < [S] and 0 ≤ j < [T]) belong to the character set Ω = {A, T, C, G,-}, any element of Ω, and the empty symbols. Design S [i] and T [j] between any two of a record score to compare the sequence identity between the pros and cons, with the score function σ (x, y) that, σ (S [i], T [j ]) = 2 (S [i] = T [j] ≠-) σ (S [i], T [j]) =-1 (S [i] ≠ T [j], S [i] ≠- , T [j] ≠-) σ (S [i], T [j]) =-2 (S [i] orT [j ]=-)。 Platform: |
Size: 4096 |
Author:zhouyanghua |
Hits:
Description: blast是目前进行生物序列比对的经典软件，本书介绍了blast的基本原理。-Blast is present in biological sequence alignment of the classic software, this book introduces the basic principle of blast. Platform: |
Size: 1430528 |
Author:李娟娟 |
Hits:
Description: 序列比对中的smith-waterman算法，应用于局部序列比对，寻找最优化比对序列，精确度高-Smith- waterman in sequence alignment algorithm, is applied to the local sequence alignment, search for optimal matching sequence, high precision Platform: |
Size: 24576 |
Author:高冲 |
Hits:
Search - sequence alignment