Mercurial > repos > metexplore > met4j

comparison tools/networkAnalysis/DegreeWeighting/DegreeWeighting.xml @ 9:0976a6257300 draft

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
planemo upload for repository https://forgemia.inra.fr/metexplore/met4j-galaxy commit 05db35f63cadb9d56dafff594a3507c59cd85273
author metexplore
date Fri, 31 Jan 2025 18:28:53 +0000
parents 7a6f2380fc1d
children 6a112eaf8f38
comparison
equal deleted inserted replaced
8:1274e2a62479 9:0976a6257300
1 <?xml version="1.0" encoding="UTF-8"?> 1 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
2 <tool id="met4j_DegreeWeighting" name="DegreeWeighting" version="MET4J_VERSION_TEST"> 2 <tool id="met4j_DegreeWeighting" name="DegreeWeighting" version="develop">
3 <description>Provides tabulated compound graph edge list, with one column with target's degree.</description> 3 <description>Provides tabulated compound graph edge list, with one column with target's degree.</description>
4 <xrefs> 4 <xrefs>
5 <xref type="bio.tools">met4j</xref> 5 <xref type="bio.tools">met4j</xref>
6 </xrefs> 6 </xrefs>
7 <requirements> 7 <requirements>
8 <container type="singularity">oras://registry.forgemia.inra.fr/metexplore/met4j/met4j-singularity:MET4J_VERSION_TEST</container> 8 <container type="singularity">oras://registry.forgemia.inra.fr/metexplore/met4j/met4j-singularity:develop</container>
9 </requirements> 9 </requirements>
10 <command detect_errors="exit_code"><![CDATA[sh /usr/bin/met4j.sh networkAnalysis.DegreeWeighting#if str($pow): 10 <command detect_errors="exit_code"><![CDATA[sh /usr/bin/met4j.sh networkAnalysis.DegreeWeighting#if str($pow):
11 -pow "$pow" 11 -pow "$pow"
12 #end if 12 #end if
13 -s "$inputPath" 13 -s "$inputPath"
43 </inputs> 43 </inputs>
44 <outputs> 44 <outputs>
45 <data format="tsv" name="outputPath"/> 45 <data format="tsv" name="outputPath"/>
46 </outputs> 46 </outputs>
47 <tests/> 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> 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.]]></help>
49 <citations/> 49 <citations>
50 <citation type="doi">10.1016/j.jmb.2005.09.079</citation>
51 </citations>
50 </tool> 52 </tool>