Mercurial > repos > metexplore > met4j

comparison tools/networkAnalysis/DistanceMatrix/DistanceMatrix.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_DistanceMatrix" name="DistanceMatrix" version="develop"> 2 <tool id="met4j_DistanceMatrix" name="DistanceMatrix" version="2.0.0">
3 <description>Create a compound to compound distance matrix.</description> 3 <description>Create a compound to compound distance matrix.</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.DistanceMatrix -i "$inputPath" 10 <command detect_errors="exit_code"><![CDATA[sh /usr/bin/met4j.sh networkAnalysis.DistanceMatrix -i "$inputPath"
11 #if str($sideCompoundFile) != 'None': 11 #if str($sideCompoundFile) != 'None':
12 -sc "$sideCompoundFile" 12 -sc "$sideCompoundFile"
13 #end if 13 #end if
32 <outputs> 32 <outputs>
33 <data format="csv" name="outputPath"/> 33 <data format="csv" name="outputPath"/>
34 </outputs> 34 </outputs>
35 <tests> 35 <tests>
36 <test> 36 <test>
37
38
39
40
41
42
43
44
45
46
47
48 <param name="inputPath" value="toy_model.xml"/> 37 <param name="inputPath" value="toy_model.xml"/>
49
50
51
52
53
54
55
56
57
58
59
60 <output ftype="csv" name="outputPath"> 38 <output ftype="csv" name="outputPath">
61
62
63
64
65
66
67
68
69
70
71
72 <assert_contents> 39 <assert_contents>
73
74
75
76
77
78
79
80
81
82
83
84 <has_n_lines n="9"/> 40 <has_n_lines n="9"/>
85
86
87
88
89
90
91
92
93
94
95
96 <has_line_matching expression="id,A,A_ext,B,C,D,D_ext,E,E_ext" n="1"/> 41 <has_line_matching expression="id,A,A_ext,B,C,D,D_ext,E,E_ext" n="1"/>
97
98
99
100
101
102
103
104
105
106
107
108 <has_line_matching expression="B,1.0,Infinity,0.0,2.0,1.0,2.0,Infinity,Infinity" n="1"/> 42 <has_line_matching expression="B,1.0,Infinity,0.0,2.0,1.0,2.0,Infinity,Infinity" n="1"/>
109
110
111
112
113
114
115
116
117
118
119
120 </assert_contents> 43 </assert_contents>
121
122
123
124
125
126
127
128
129
130
131
132 </output> 44 </output>
133
134
135
136
137
138
139
140
141
142
143
144 </test> 45 </test>
145 <test> 46 <test>
146
147
148
149
150
151
152
153
154
155
156
157 <param name="inputPath" value="toy_model.xml"/> 47 <param name="inputPath" value="toy_model.xml"/>
158
159
160
161
162
163
164
165
166
167
168
169 <param name="sideCompoundFile" value="sides.txt"/> 48 <param name="sideCompoundFile" value="sides.txt"/>
170
171
172
173
174
175
176
177
178
179
180
181 <param name="degree" value="true"/> 49 <param name="degree" value="true"/>
182
183
184
185
186
187
188
189
190
191
192
193 <param name="undirected" value="true"/> 50 <param name="undirected" value="true"/>
194
195
196
197
198
199
200
201
202
203
204
205 <output ftype="csv" name="outputPath"> 51 <output ftype="csv" name="outputPath">
206
207
208
209
210
211
212
213
214
215
216
217 <assert_contents> 52 <assert_contents>
218
219
220
221
222
223
224
225
226
227
228
229 <has_n_lines n="8"/> 53 <has_n_lines n="8"/>
230
231
232
233
234
235
236
237
238
239
240
241 <has_line_matching expression="id,A,B,C,D,D_ext,E,E_ext" n="1"/> 54 <has_line_matching expression="id,A,B,C,D,D_ext,E,E_ext" n="1"/>
242
243
244
245
246
247
248
249
250
251
252
253 <has_line_matching expression="A,0.0,4.0,4.0,20.0,21.0,24.0,25.0" n="1"/> 55 <has_line_matching expression="A,0.0,4.0,4.0,20.0,21.0,24.0,25.0" n="1"/>
254
255
256
257
258
259
260
261
262
263
264
265 <has_line_matching expression="B,4.0,0.0,8.0,16.0,17.0,20.0,21.0" n="1"/> 56 <has_line_matching expression="B,4.0,0.0,8.0,16.0,17.0,20.0,21.0" n="1"/>
266
267
268
269
270
271
272
273
274
275
276
277 <has_line_matching expression="C,4.0,8.0,0.0,16.0,17.0,20.0,21.0" n="1"/> 57 <has_line_matching expression="C,4.0,8.0,0.0,16.0,17.0,20.0,21.0" n="1"/>
278
279
280
281
282
283
284
285
286
287
288
289 <has_line_matching expression="D,8.0,4.0,4.0,0.0,1.0,4.0,5.0" n="1"/> 58 <has_line_matching expression="D,8.0,4.0,4.0,0.0,1.0,4.0,5.0" n="1"/>
290
291
292
293
294
295
296
297
298
299
300
301 </assert_contents> 59 </assert_contents>
302
303
304
305
306
307
308
309
310
311
312
313 </output> 60 </output>
314
315
316
317
318
319
320
321
322
323
324
325 </test> 61 </test>
326 </tests> 62 </tests>
327 <help><![CDATA[Create a compound to compound distance matrix. 63 <help><![CDATA[Create a compound to compound distance matrix.
328 The distance between two compounds is computed as the length of the shortest path connecting the two in the compound graph, where two compounds are linked if they are respectively substrate and product of the same reaction. 64 The distance between two compounds is computed as the length of the shortest path connecting the two in the compound graph, where two compounds are linked if they are respectively substrate and product of the same reaction.
329 An optional edge weighting can be used, turning the distances into the sum of edge weights in the lightest path, rather than the length of the shortest path.The default weighting use target's degree squared. Alternatively, custom weighting can be provided in a file. In that case, edges without weight are ignored during path search. 65 An optional edge weighting can be used, turning the distances into the sum of edge weights in the lightest path, rather than the length of the shortest path.The default weighting use target's degree squared. Alternatively, custom weighting can be provided in a file. In that case, edges without weight are ignored during path search.