Disorder gerneral

From Bioinformatikpedia
Revision as of 12:08, 11 August 2011 by Link (talk | contribs) (Created page with "== DISOPRED == ''Authors:'' Ward JJ, Sodhi JS, McGuffin LJ, Buxton BF, Jones DT.<br> ''Year:'' 2004<br> ''Source:'' [[http://www.ncbi.nlm.nih.gov/pubmed/15019783 Prediction and …")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

DISOPRED

Authors: Ward JJ, Sodhi JS, McGuffin LJ, Buxton BF, Jones DT.
Year: 2004
Source: [Prediction and functional analysis of native disorder in proteins from the three kingdoms of life.]

Description

This method is based on a neuronal network which was trained on high resolution X-ray structures from PDB. Disordered regions are regions, which appear in the sequence record, but their electrons are missing from electronic density map. This approach can also failed, because missing electrons can also arise because of the cristallization process. The method runs first a PsiBlast search against a filtered sequence database. Next, a profile for each residue is calculated and classified by using the trained neuronal network.

Input

If you run disopred on the console, you have to define the location of your database. The program needs as input your sequence in a file with fasta format.

Output

As a prediction result you get a file with the predicted disordered region, the precision and recall. Furthermore you can get a more detailed output. There you see the sequence, and the predictions and also how likely the prediction for each residue is.

[Back to sequence-based prediction]

POODLE

Prediction of order and disorder by machine-learning
Authors: S. Hirose, K. Shimizu, S. Kanai, Y. Kuroda and T. Noguchi
Year: 2007

Description

POODLE is based on a machine learning algorithm. This method is based on a 2-level SVM (Support Vector Machine).

We describe here the POODLE-L algorithm in detail, but all POODLE variants use the same principle. The method was trained on disordered proteins and proteins with no disoredered regions. On the first level, the SVM predicts the probability of a 40-residue sequence segment to be disordered. If the algorithm found such a disordered region, the second level of the SVM use the output from the first level and predicts the probability to be disordered for each amino acid.

Different variants of POODLE

POODLE-L

Describtion: Prediction of long disorderd redions.
Source: [POODLE-L: a two-level SVM prediction system for reliably predicting long disordered regions.]

POODLE-S

Describtion: Prediction of short disorderd redions.
Source: [POODLE-S: web application for predicting protein disorder by using physicochemical features and reduced amino acid set of a position-specific scoring matrix.]

POODLE-I

Description: Integrates structural information predictors.
Source: [POODLE-I: Disordered region prediction by integrating POODLE series and structural information predictors based on a workflow approach]

POODLE-W

Description: Compares different sequences and predicts which sequence is the most disordered one. (is not used in this analysis)

Input

We used the [POODLE webserver] for our analysis. We paste our sequence in FASTA-format in the input window and chose the POODLE variant.

Output

The result of this method is a file with the single amino acids, the prediction if it is ordered or not and the probability for the state. Furtheremore, you get a graphical view of the result.


[Back to sequence-based prediction]

IUPred

Authors: Zsuzsanna Dosztányi, Veronika Csizmók, Péter Tompa and István Simon
Year: 2005
Source: [IUPred: web server for the prediction of intrinsically unstructured regions of proteins based on estimated energy content]

Description

IUpred calculates the pairwise energy profile along a sequence. After that the algorithm transforms the energy values into a probabilisitic score, which is between 0 and 1. A score of 0 means complete order, whereas scores up to 1 mean complete disorder. The cutoff is 0.5. All residues with a score more than 0.5 are predicted as disordered.
The [Webserver] offers three different prediction methods, one focus on long disordered regions, the other method focus on short disordered regions. Furthermore, with the third method, it is possible to predict disordered regions with additional structure information.

Input

We used the [Webserver] for our analysis. The input for the webserver is only the sequence in FASTA-format.

Output

As an output you get a graphical representation of the prediction and a detail list of the scores of each amino acid. Sadly, it is not possible to download the scores in a text file, so therefore you have to use the picture or to copy the data manually.


[Back to sequence-based prediction]

Meta-Disorder

Authors:Schlessinger A, Punta M, Yachdav G, Kajan L, Rost B
Year: 2009
Source: [Improved Disorder Prediction by Combination of Orthogonal Approaches.]

Description

Meta-Disorder combines different disordered prediction methods, which have differenct focus. Therefore, it is possible to avoid a bias to one prediction method. The combined methods are NORSnet (uses NORS for the prediction of disordered regions), PROFbval (uses mobility of the residues for prediction), Ucon (uses contacts for prediction) and DISOPRED (see above). Furthermore, Meta-Disorder also uses additional useful features like solvent accessibility or secondary structure.

Input

We used the [Webserver ] for our prediction. The input for the server is only the amino acid sequence of the protein.

Output

The user has the possibility to choose between different output formats. All formats are available for each prediction and the user chooses the format after the prediction and therefore, has the possility to jump between the formats. Very useful for our purpose was the visual output, because there the user gets a nice picture of the prediction. Also very useful is the text or html output, because there is a detailed list of the different predictions, used scores and probabilites.

[Back to sequence-based prediction]