Mercurial > repos > metexplore > met4j
comparison build/tools/DegreeWeighting/DegreeWeighting.xml @ 6:7a6f2380fc1d draft
planemo upload for repository https://forgemia.inra.fr/metexplore/met4j-galaxy
| author | metexplore |
|---|---|
| date | Wed, 17 May 2023 13:26:37 +0000 |
| parents | |
| children | 1436e9cde9c9 |
comparison
equal
deleted
inserted
replaced
| 5:35c9abcd8934 | 6:7a6f2380fc1d |
|---|---|
| 1 <?xml version="1.0" encoding="UTF-8"?> | |
| 2 <tool id="met4j_DegreeWeighting" name="DegreeWeighting" version="1.3.0"> | |
| 3 <description>Provides tabulated compound graph edge list, with one column with target's degree.</description> | |
| 4 <xrefs> | |
| 5 <xref type="bio.tools">met4j</xref> | |
| 6 </xrefs> | |
| 7 <requirements> | |
| 8 <container type="singularity">oras://registry.forgemia.inra.fr/metexplore/met4j/met4j-singularity:1.3.0</container> | |
| 9 </requirements> | |
| 10 <command detect_errors="exit_code"><![CDATA[sh /usr/bin/met4j.sh networkAnalysis.DegreeWeighting#if str($pow): | |
| 11 -pow "$pow" | |
| 12 #end if | |
| 13 -s "$inputPath" | |
| 14 #if str($inputSide) != 'None': | |
| 15 -sc "$inputSide" | |
| 16 #end if | |
| 17 #if str($mergingStrat): | |
| 18 -mc "$mergingStrat" | |
| 19 #end if | |
| 20 $mergeEdges | |
| 21 $undirected | |
| 22 $computeWeight | |
| 23 $removeNaN | |
| 24 -o "$outputPath" | |
| 25 ]]></command> | |
| 26 <inputs> | |
| 27 <param argument="-pow" label="set weights as the degree raised to the power of number in parameter." name="pow" optional="true" type="text" value="1"> | |
| 28 <sanitizer invalid_char="_"> | |
| 29 <valid initial="string.printable"/> | |
| 30 </sanitizer> | |
| 31 </param> | |
| 32 <param argument="-s" format="sbml" label="input SBML file" name="inputPath" optional="false" type="data" value=""/> | |
| 33 <param argument="-sc" format="txt" label="input Side compound file" name="inputSide" optional="true" type="data" value=""/> | |
| 34 <param argument="-mc" label="merge compartments. Use names if consistent and unambiguous across compartments, or identifiers if compartment suffix is present (id in form "xxx_y" with xxx as base identifier and y as compartment label)." name="mergingStrat" optional="true" type="select" value="no"> | |
| 35 <option selected="true" value="no">no</option> | |
| 36 <option value="by_name">by_name</option> | |
| 37 <option value="by_id">by_id</option> | |
| 38 </param> | |
| 39 <param argument="-me" checked="false" falsevalue="" label="merge parallel edges to produce a simple graph" name="mergeEdges" truevalue="-me" type="boolean" value="false"/> | |
| 40 <param argument="-un" checked="false" falsevalue="" label="create as undirected" name="undirected" truevalue="-un" type="boolean" value="false"/> | |
| 41 <param argument="-tp" checked="false" falsevalue="" label="set weight as random walk transition probability, normalized by reaction" name="computeWeight" truevalue="-tp" type="boolean" value="false"/> | |
| 42 <param argument="-nan" checked="false" falsevalue="" label="do not output edges with undefined weight" name="removeNaN" truevalue="-nan" type="boolean" value="false"/> | |
| 43 </inputs> | |
| 44 <outputs> | |
| 45 <data format="tsv" name="outputPath"/> | |
| 46 </outputs> | |
| 47 <tests/> | |
| 48 <help><![CDATA[Provides tabulated compound graph edge list, with one column with target's degree.Degree has been proposed as edge weight for finding meaningful paths in metabolic networks, using shortest (lightest) path search. See Croes et al. 2006 (https://doi.org/10.1016/j.jmb.2005.09.079) and Croes et al. 2005 (https://doi.org/10.1093/nar/gki437)]]></help> | |
| 49 <citations/> | |
| 50 </tool> |