Difference between revisions of "Sequence Alignments TSD"
From Bioinformatikpedia
(→PSI-Blast) |
|||
| Line 28: | Line 28: | ||
| style="border-style: solid; border-width: 0 0 0 0" | |
| style="border-style: solid; border-width: 0 0 0 0" | |
||
|- |
|- |
||
| − | | style="border-style: solid; border-width: 0 0 0 0" |No. hits |
||
| − | | style="border-style: solid; border-width: 0 0 0 0" | |
||
| − | | style="border-style: solid; border-width: 0 0 0 0" | |
||
| − | | style="border-style: solid; border-width: 0 0 0 0" | |
||
|- |
|- |
||
Revision as of 20:31, 3 May 2012
Sequence searches
There are several alignment methods provided by various initiatives, who tackle the problem of sequence searches. Here some of them are applied for the Hex A protein and analyzed. For the searches non redundant protein databases are used. The outputs are adapted to each other and put in comparison in order to determine the best results. A protocol containing the basic steps taken is available.
Blast
PSI-Blast
| Iterations | 2 | 2 | 10 | 10 |
|---|---|---|---|---|
| E-value | 0.002 | 10E-10 | 0.002 | 10E-10 |
| Runtime |
Table 1: Different performances of PSI-Blast.
