Mercurial > repos > metexplore > met4j

comparison tools/networkAnalysis/LoadPoint/LoadPoint.xml @ 1:9b162ee6ff8e 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 12798951d21c3b2b13514b38148b2848cb422c95
author metexplore
date Mon, 27 Jun 2022 13:41:08 +0000
parents dcd16521b969
children e69a78624877
comparison
equal deleted inserted replaced
0:dcd16521b969 1:9b162ee6ff8e
1 <?xml version="1.0" encoding="UTF-8"?> 1 <?xml version="1.0" encoding="UTF-8"?>
2 <tool id="met4j_LoadPoint" name="LoadPoint" version="0.11.0"> 2 <tool id="met4j_LoadPoint" name="LoadPoint" version="0.12.0">
3 <description>Compute the Load points of a metabolic network. Load points constitute an indicator of lethality and can help identifying drug target.</description> 3 <description>Compute the Load points of a metabolic network. Load points constitute an indicator of lethality and can help identifying drug target.</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:0.11.0</container> 8 <container type="singularity">oras://registry.forgemia.inra.fr/metexplore/met4j/met4j-singularity:0.12.0</container>
9 </requirements> 9 </requirements>
10 <command detect_errors="exit_code"><![CDATA[sh /usr/bin/met4j.sh networkAnalysis.LoadPoint -i "$inputPath" 10 <command detect_errors="exit_code"><![CDATA[sh /usr/bin/met4j.sh networkAnalysis.LoadPoint -i "$inputPath"
11 #if str($sideCompoundFile) != 'None': 11 #if str($sideCompoundFile) != 'None':
12 -s "$sideCompoundFile" 12 -s "$sideCompoundFile"
13 #end if 13 #end if
46 p is the number of shortest paths passing through a metabolite m; 46 p is the number of shortest paths passing through a metabolite m;
47 k is the number of nearest neighbour links for m in the network; 47 k is the number of nearest neighbour links for m in the network;
48 P is the total number of shortest paths; 48 P is the total number of shortest paths;
49 K is the sum of links in the metabolic network of M metabolites (where M is the number of metabolites in the network). 49 K is the sum of links in the metabolic network of M metabolites (where M is the number of metabolites in the network).
50 Use of the logarithm makes the relevant values more distinguishable.]]></help> 50 Use of the logarithm makes the relevant values more distinguishable.]]></help>
51 <citations/>
51 </tool> 52 </tool>