Mercurial > repos > rnateam > viennarna_kinwalker

comparison kinwalker.xml @ 0:b13a2b5a811a draft

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
planemo upload for repository https://github.com/bgruening/galaxytools/tree/master/tools/rna_tools/vienna_rna commit 3103ebed1a420c7d3415b67ef532ea579edf9faa
author rnateam
date Wed, 12 Jul 2017 14:25:23 -0400
parents
children
comparison
equal deleted inserted replaced
-1:000000000000 0:b13a2b5a811a
1 <tool id="viennarna_kinwalker" name="@EXECUTABLE@" version="@VERSION@.0">
2 <description>cotranscriptional folding of RNAs</description>
3 <macros>
4 <token name="@EXECUTABLE@">kinwalker</token>
5 <import>macros.xml</import>
6 </macros>
7 <expand macro="requirements" />
8 <expand macro="stdio" />
9 <expand macro="version_command" />
10 <command>
11 <![CDATA[
12 head -n 1 '$input_sequence' | head -c -1 -q > seq.ident
13 &&
14 sed '1d' '$input_sequence' > input.seq
15 &&
16 kinwalker
17 $init_structure
18 $interrupt
19 ##$printfront
20
21 --barrier_heuristic $barrier_heuristic.used
22
23 #if $barrier_heuristic.used == "M"
24 --grouping $barrier_heuristic.grouping
25 --lookahead $barrier_heuristic.lookahead
26 #else if $barrier_heuristic.used == "B"
27 --maxkeep $barrier_heuristic.maxkeep
28 #end if
29
30 --dangle $dangle
31 --noLonelyPairs $noLonelyPairs
32 --transcribed $transcribed
33 --transcription_rate $transcription_rate
34 --windowsize $windowsize
35
36 < input.seq
37
38 > blah
39
40 &&
41 sed -n '2s/[\.\(\)]\+\s\+\(.\+\)$/ mfe: \1/p' blah > energy
42
43 &&
44 cat seq.ident energy > '$mfe_struct'
45
46 &&
47 sed -e '2s/^\([\.\(\)]\+\).*$/\1/' -ne '1,2p' blah >> '$mfe_struct'
48
49 &&
50 sed -e 's/[ \t]*$//' -ne '/TRAJ/,/Kinwal/ {/TRAJ/n;/Kinwal/!{s/\s/\t/gp}}' blah > '$trajectory'
51 ]]>
52 </command>
53 <inputs>
54 <param name="input_sequence" format="fasta" type="data" label="Input sequence" help="A single sequence in FASTA format"/>
55 <param name="init_structure" type="boolean" truevalue="--init_structure" falsevalue="" checked="false" label="Start with a structure other than the open chain" help="(--init_structure)"/>
56 <param name="interrupt" type="boolean" truevalue="--interrupt" falsevalue="" checked="false" label="Allow interrupted folding trajectories when the barrier is exceeded" help="(--interrupt)"/>
57 <!-- need to implement with dataset collections <param name="printfront" type="boolean" truevalue="!doublehypen!printfront" falsevalue="" checked="true" label="Creates PS plots of front progression" help="(!doublehypen!printfront)"/> -->
58 <conditional name="barrier_heuristic">
59 <param name="used" type="select" label="Barrier Heuristic" help="(--barrier_heuristic)">
60 <option value="M" selected="true">Morgan-Higgs</option>
61 <option value="S">Limit small stacks</option>
62 <option value="B">Barriers</option>
63 <option value="A">All</option>
64 </param>
65 <when value="M">
66 <param name="grouping" type="select" label="How to treat conflict groups" help="(--grouping)">
67 <option value="standard" selected="true">Standard</option>
68 <option value="regroup">Re-group</option>
69 </param>
70 <param name="lookahead" type="integer" value="1" label="Number of basepairs that MorganHiggs forms its subpaths from" help="(--lookahead)"/>
71 </when>
72 <when value="S" />
73 <when value="B">
74 <param name="maxkeep" type="integer" value="1" label="Breadth of breadth first search" help="(--maxkeep)"/>
75 </when>
76 <when value="A" />
77 </conditional>
78 <param name="dangle" type="select" label="Dangle value as in VienneRNA package" help="(--dangle)">
79 <option value="0" selected="true">0</option>
80 <option value="1">1</option>
81 <option value="2">2</option>
82 </param>
83 <param name="noLonelyPairs" type="integer" value="2" label="Value of noLonelyPairs as in ViennaRNA" help="(--noLonelyPairs)"/>
84
85 <param name="transcribed" type="integer" value="1" label="Number of bases initially transcribed" help="0 means all is transcribed (--transcribed)"/>
86 <param name="transcription_rate" type="float" value="200" label="Number of bases transcribed per second" help="(--transcription_rate)"/>
87 <param name="windowsize" type="integer" value="0" label="Max size of substructures considered for folding events during transcription" help="0= all are considered. (--windowsize)"/>
88 </inputs>
89 <outputs>
90 <data format="fasta" name="mfe_struct" label="MFE structure from ${tool.name} on ${on_string}" />
91 <data format="tabular" name="trajectory" label="Trajectory of ${tool.name} on ${on_string}" />
92 </outputs>
93 <tests>
94 <test>
95 <param name="input_sequence" value="test_sequence_input.fasta" />
96 <param name="init_structure" value="" />
97 <param name="interrupt" value="" />
98 <param name="used" value="M" />
99 <param name="grouping" value="standard" />
100 <param name="lookahead" value="1" />
101 <param name="dangle" value="0" />
102 <param name="noLonelyPairs" value="2" />
103 <param name="transcribed" value="1" />
104 <param name="transcription_rate" value="200" />
105 <param name="windowsize" value="0" />
106 <output name="mfe_struct" file="mfe_struct_result.fasta" />
107 <output name="trajectory" file="trajectory_result.tabular" />
108 </test>
109 </tests>
110 <help>
111 <![CDATA[
112 **What it does**
113
114 Kinwalker splits the folding process into a series of events where each event can either be a folding event or a transcription event. In each transcription event one base from the RNA sequence is appended to the already transcribed and (partially) folded subsequence.
115 Kinwalker executes transcription events at regular time intervals. In each folding event a subsequence of the already transcribed RNA sequence is selected and a new structure is formed by combining base pairs from the current structure with base pairs from the mfE structure of that subsequence.
116
117 This is done in such a way that the new structure includes base pairs from both structures in an energetically favorable manner. Kinwalker estimates the waiting times for individual folding events depending on the height of the energy barrier between the current structure and the new structure into which the molecule is folded. Folding events between structures can only occur, if the energy barrier between them is less than the maximum allowed energy barrier.
118
119 As folding paths can only be calculated exhaustively for short sequences (n>100), heuristic approaches have to be employed which explicitly construct a (re)folding path between the two structures. The saddle height is then estimated as the highest point along the path. The best known algorithm for approximating saddle heights between RNA conformations is the Morgan-Higgs heuristic, which tries to find a folding path from an origin secondary structure to a target secondary structure where the maximum height along the path is minimal. The heuristic models state transitions at base pair resolution.
120 ]]>
121
122 **Input**
123
124 RNA sequence in FASTA format
125
126 **Output**
127
128 RNA folding trajectory
129
130 </help>
131 <citations>
132 <citation type="doi">10.1016/j.jmb.2008.02.064</citation>
133 </citations>
134 </tool>