view rnainverse.xml @ 3:0633dbe1b6ed draft

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:23:13 -0400
parents 22674cf7b11e
children
line wrap: on
line source

<tool id="viennarna_rnainverse" name="@EXECUTABLE@" version="@VERSION@.0">
    <description>Calculate RNA sequence from secondary structure</description>    
    <macros>
        <token name="@EXECUTABLE@">RNAinverse</token>
        <import>macros.xml</import>
    </macros>
    <expand macro="requirements" />
    <expand macro="stdio" />
    <expand macro="version_command" />
    <command>
<![CDATA[
    RNAinverse < '$input' > '$outfile'
    --function=#echo ''.join(str($algo).split(','))
    -R$reps
    --final=$final
    #if $varExists('$advancedOptions.nogu')
        $advancedOptions.nogu
        $advancedOptions.noclosinggu
        $advancedOptions.notetra
    #end if
]]>
    </command>
    <inputs>
        <param format="fasta" name="input" type="data" label="Clustal alignment file"/>
        <param name="temperature" type="float" value="37.0" label="Temperature [°C]" help="-T"/>

        <param name="reps" type="integer" value="1" min="1" label="Find so many sequences that fold close to that structure" help="-R: This parameter could be negative to search for exact solutions, but in that case the program might not terminate. If you need this functionality contact your admin or run the program locally."/>

        <param name="algo" type="select" multiple="true" display="checkboxes" label="Use these functions" argument="--function">
                <option value="m" selected="true">minimum energy</option>
                <option value="p">partition function</option>
        </param>
        <param name="final" type="float" value="0.0" label="If partition function is selected this value determines the convergence criterium." help="--final"/>

        <param name="dangling" type="select" label="how to treat dangling end energies" help="-d">
            <option value="2" selected="true">unpaired bases participate in all dangling ends (2)</option>
            <option value="0">ignore dangling ends (0)</option>
            <option value="1">unpaired bases participate in one dangling end only (1)</option>
            <option value="3">allow coaxial stacking (3)</option>
        </param>

        <conditional name="advancedOptions">
            <param name="advancedSelector" type="select"  label="advanced options">
                <option value="basic">basic Options</option>
                <option value="advanced">advanced Options</option>
            </param>
            <when value="advanced">
                <param name="nogu" type="boolean" truevalue="" falsevalue="--noGU" checked="true" label="Allow GU pairing" help="--noGU"/>
                <param name="noclosinggu" type="boolean" truevalue="" falsevalue="--noClosingGU" checked="true" label="Allow GU pairing at the ends" help="Allow pairing of G and U at the ends of helices. --noClosingGU"/>
                <param name="notetra" type="boolean" truevalue="" falsevalue="--noTetra" checked="true" label="Allow stabilization for loops, hairpins etc." help=" Include special tabulated stabilizing energies for tri-, tetra- and hexaloop hairpins. Mostly for testing. (--noTetra)"/>
            </when>
            <when value="basic">
            </when>
        </conditional>
    </inputs>
    <outputs>
        <data format="txt" name="outfile"/>
    </outputs>
    <tests>
        <test>
            <param name="input" value="rnainverse_input1.clu"/>
            <output name="outfile">
                <assert_contents>
                    <has_line_matching expression="^gggccccnnaauun.*"/>
                </assert_contents>
            </output>
        </test>
    </tests>
    <help>
<![CDATA[
**RNAinverse**

The program searches for sequences folding into a predefined structure, thereby inverting the folding algorithm. For each search the best sequence found and its Hamming distance to the start sequence are printed. If the the search was unsuccessful, a structure distance to the target is appended.


-----

**Input format**

Input is similar to a Fasta file. First line should be the structure in dot-bracket notation, second line the starting sequence. Lines with '>' in the beginning are treated as comments. Characters in the start sequence other than "AUGC" will be treated as wild cards and replaced by a random character. Any lower case characters in the start sequence will be kept fixed during the search. If necessary, the sequence will be elongated to the length of the structure. Thus a string of "N"s as well as a blank line specify a random start sequence.

------

**Outputs**

- text output of each sequence with its Hamming distance and/or the energy if the partition function is selected

]]>
    </help>
    <expand macro="citations" />
</tool>