tutorials:eccb_t2_badasp
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| tutorials:eccb_t2_badasp [2012/09/07 15:51] – romainstuder | tutorials:eccb_t2_badasp [2012/09/08 16:15] (current) – romainstuder | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ==== BADASP ==== | ==== BADASP ==== | ||
| - | BADASP can produce different | + | BADASP can produce different |
| * bad: similar the **Type II** of functional divergence. The threshold to choose depend if we want to be stringeant (i.e. BAD > 4) or more relaxed (BAD > 2). | * bad: similar the **Type II** of functional divergence. The threshold to choose depend if we want to be stringeant (i.e. BAD > 4) or more relaxed (BAD > 2). | ||
| Line 26: | Line 26: | ||
| We want to identify the residues making differences between the **isoforms 1** and **isoforms 4** of the V-type proton ATPase 116 kDa subunit a. | We want to identify the residues making differences between the **isoforms 1** and **isoforms 4** of the V-type proton ATPase 116 kDa subunit a. | ||
| + | First, visualise briefly the multiple alignment in Jalview. (File " | ||
| - | < | ||
| - | cd ./ | ||
| - | </ | ||
| Execute **badasp** by importing the multiple alignment in FASTA format (" | Execute **badasp** by importing the multiple alignment in FASTA format (" | ||
| - | < | + | |
| + | < | ||
| + | cd ./ | ||
| + | python badasp.py seqin=badasp_eg.fas i=1</ | ||
| Badasp will ask for the associated tree, in newick format (" | Badasp will ask for the associated tree, in newick format (" | ||
| Line 42: | Line 43: | ||
| => Press enter | => Press enter | ||
| + | </ | ||
| Display Tree, with two groups of sequences: | Display Tree, with two groups of sequences: | ||
| V-type proton ATPase 116 kDa subunit a | V-type proton ATPase 116 kDa subunit a | ||
| - | - VPP1 = VPP Isoform 1 (8 genes) | + | |
| - | - NVL = VPP Isoform 4 (3 genes) | + | * NVL = VPP Isoform 4 (3 genes) |
| + | < | ||
| Rooted Tree (1000 bootstraps). Branch Lengths given. 21 nodes. | Rooted Tree (1000 bootstraps). Branch Lengths given. 21 nodes. | ||
| => Press enter | => Press enter | ||
| Line 70: | Line 71: | ||
| => Press enter | => Press enter | ||
| - | # We need to split the tree on the node 21, so we need to define two groups from the children nodes 20 (= VPP1 subfamily) and 19 (= VPP4 subfamily) . | + | # We need to split the tree on the node 21, |
| + | # so we need to define two groups from the children nodes 20 (= VPP1 subfamily) and 19 (= VPP4 subfamily) . | ||
| => Press M, then enter. | => Press M, then enter. | ||
| (Tree displayed) | (Tree displayed) | ||
| - | Choice? [default=Q]: | + | Choice? [default=Q]: |
| Node [default=0]: | Node [default=0]: | ||
| => Type VPP1, then Press enter | => Type VPP1, then Press enter | ||
| - | Choice? [default=Q]: | + | Choice? [default=Q]: |
| Node [default=0]: | Node [default=0]: | ||
| => Type VPP4, then Press enter | => Type VPP4, then Press enter | ||
| Line 95: | Line 97: | ||
| </ | </ | ||
| - | Badasp will now perform some computation. It will reconstruct the ancestral sequences at each node of the tree, using GASP (ref: http: | + | Badasp will now perform some computations. It will reconstruct the ancestral sequences at each node of the tree, using GASP (ref: http: |
| < | < | ||
tutorials/eccb_t2_badasp.1347033071.txt.gz · Last modified: by romainstuder
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 4.0 International
