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. Platform: |
Size: 614606 |
Author:Galaxy |
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: An Implementation of Smith Waterman Algorithm which compares two sequences and gives the common sequences along with the score Platform: |
Size: 2048 |
Author:codingnovice |
Hits:
Description: 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 secondary structure. This program is able to deal with "bulge","hairpin loop" efficiently but can not handle "pseudoknot . Platform: |
Size: 3072 |
Author:hsingjun |
Hits:
Description: 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
Protein secondary structure prediction using GOR IV and PSIPRED
Phylogenetic analysis with Phylip
Search for restriction enzymes and integration with REBASE
Extremely fast repeat finder
DNA reference assembly using Bowtie
Search for transcription factor binding sites using SITECON
Protein back translation
ORF finder
Complete Smith-Waterman algorithm implementation
Comparing genomes using dotplot view.
-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
Protein secondary structure prediction using GOR IV and PSIPRED
Phylogenetic analysis with Phylip
Search for restriction enzymes and integration with REBASE
Extremely fast repeat finder
DNA reference assembly using Bowtie
Search for transcription factor binding sites using SITECON
Protein back translation
ORF finder
Complete Smith-Waterman algorithm implementation
Comparing genomes using dotplot view.
Platform: |
Size: 12673024 |
Author:baaaa |
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:
Description: 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 known
example of a time and space consuming. The Smith-
Waterman algorithm is a well recognized technique to
produce optimal alignment between DNA sequences. In
this paper, we present a parallel technique for computing
Smith-Waterman algorithm. The implementation is done
under a master-worker based distributed memory
multiprocessors with Single Program Multiple Data
(SPMD) architecture. The MPJ Express, an object
oriented Message Passing Interface software is utilized to
enable instructions and messages to be exchanged
between processors. Platform: |
Size: 160768 |
Author:silkan_h |
Hits:
Description: 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 are developed on the basis of the algorithm.) Platform: |
Size: 6209536 |
Author:伟少侠
|
Hits:
Description: 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 are developed on the basis of the algorithm.) Platform: |
Size: 4681728 |
Author:伟少侠
|
Hits:
Search - Smith-Waterman algorithm