Mercurial > repos > metexplore > met4j

comparison build/tools/ExtractSubNetwork/ExtractSubNetwork.xml @ 10:6a112eaf8f38 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 71071300dd662ad01bd064abcf6866a192eeea95
author metexplore
date Mon, 03 Feb 2025 15:59:46 +0000
parents 0976a6257300
children 40c15b7467f1
comparison
equal deleted inserted replaced
9:0976a6257300 10:6a112eaf8f38
1 <?xml version="1.0" encoding="UTF-8" standalone="no"?> 1 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
2 <tool id="met4j_ExtractSubNetwork" name="ExtractSubNetwork" version="develop"> 2 <tool id="met4j_ExtractSubNetwork" name="ExtractSubNetwork" version="2.0.0">
3 <description>Create a subnetwork from a metabolic network in SBML format, and two files containing lists of compounds of interests ids, one per row.</description> 3 <description>Create a subnetwork from a metabolic network in SBML format, and two files containing lists of compounds of interests ids, one per row.</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:develop</container> 8 <container type="singularity">oras://registry.forgemia.inra.fr/metexplore/met4j/met4j-singularity:2.0.0</container>
9 </requirements> 9 </requirements>
10 <command detect_errors="exit_code"><![CDATA[sh /usr/bin/met4j.sh networkAnalysis.ExtractSubNetwork -i "$inputPath" 10 <command detect_errors="exit_code"><![CDATA[sh /usr/bin/met4j.sh networkAnalysis.ExtractSubNetwork -i "$inputPath"
11 -s "$sourcePath" 11 -s "$sourcePath"
12 -t "$targetPath" 12 -t "$targetPath"
13 #if str($sideCompoundFile) != 'None': 13 #if str($sideCompoundFile) != 'None':
54 <outputs> 54 <outputs>
55 <data format="txt" name="output"/> 55 <data format="txt" name="output"/>
56 </outputs> 56 </outputs>
57 <tests> 57 <tests>
58 <test> 58 <test>
59
60
61
62 <param name="inputPath" value="toy_model.xml"/> 59 <param name="inputPath" value="toy_model.xml"/>
63
64
65
66 <param name="sourcePath" value="seeds.txt"/> 60 <param name="sourcePath" value="seeds.txt"/>
67
68
69
70 <param name="targetPath" value="targets.txt"/> 61 <param name="targetPath" value="targets.txt"/>
71
72
73
74 <param name="format" value="gml"/> 62 <param name="format" value="gml"/>
75
76
77
78 <output ftype="txt" name="output"> 63 <output ftype="txt" name="output">
79
80
81
82 <assert_contents> 64 <assert_contents>
83
84
85
86 <has_line_matching expression=".*node.*" n="3"/> 65 <has_line_matching expression=".*node.*" n="3"/>
87
88
89
90 <has_line_matching expression=".*edge.*" n="2"/> 66 <has_line_matching expression=".*edge.*" n="2"/>
91
92
93
94 </assert_contents> 67 </assert_contents>
95
96
97
98 </output> 68 </output>
99
100
101
102 </test> 69 </test>
103 </tests> 70 </tests>
104 <help><![CDATA[Create a subnetwork from a metabolic network in SBML format, and two files containing lists of compounds of interests ids, one per row. 71 <help><![CDATA[Create a subnetwork from a metabolic network in SBML format, and two files containing lists of compounds of interests ids, one per row.
105 The subnetwork corresponds to the part of the network that connects compounds from the first list to compounds from the second list. 72 The subnetwork corresponds to the part of the network that connects compounds from the first list to compounds from the second list.
106 Sources and targets list can have elements in common. The connecting part can be defined as the union of shortest or k-shortest paths between sources and targets, or the Steiner tree connecting them. The relevance of considered path can be increased by weighting the edges using degree squared, chemical similarity (require InChI or SMILES annotations) or any provided weighting. 73 Sources and targets list can have elements in common. The connecting part can be defined as the union of shortest or k-shortest paths between sources and targets, or the Steiner tree connecting them. The relevance of considered path can be increased by weighting the edges using degree squared, chemical similarity (require InChI or SMILES annotations) or any provided weighting.
107
108 See previous works on subnetwork extraction for parameters recommendations.]]></help> 74 See previous works on subnetwork extraction for parameters recommendations.]]></help>
109 <citations> 75 <citations>
110 <citation type="doi">10.1093/bib/bbv115</citation> 76 <citation type="doi">10.1093/bib/bbv115</citation>
111 <citation type="doi">10.1016/j.biosystems.2011.05.004</citation> 77 <citation type="doi">10.1016/j.biosystems.2011.05.004</citation>
112 <citation type="doi">10.1016/j.jmb.2005.09.079</citation> 78 <citation type="doi">10.1016/j.jmb.2005.09.079</citation>