Mercurial > repos > metexplore > met4j
comparison tools/networkAnalysis/SeedsAndTargets/SeedsAndTargets.xml @ 10:6a112eaf8f38 draft
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_SeedsAndTargets" name="SeedsAndTargets" version="develop"> | 2 <tool id="met4j_SeedsAndTargets" name="SeedsAndTargets" version="2.0.0"> |
3 <description>Identify exogenously acquired compounds, exogenously available producible compounds and/or dead ends metabolites from metabolic network topology</description> | 3 <description>Identify exogenously acquired compounds, exogenously available producible compounds and/or dead ends metabolites from metabolic network topology</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.SeedsAndTargets -i "$inputPath" | 10 <command detect_errors="exit_code"><![CDATA[sh /usr/bin/met4j.sh networkAnalysis.SeedsAndTargets -i "$inputPath" |
11 #if str($inputSide) != 'None': | 11 #if str($inputSide) != 'None': |
12 -sc "$inputSide" | 12 -sc "$inputSide" |
13 #end if | 13 #end if |
42 <outputs> | 42 <outputs> |
43 <data format="tsv" name="outputPath"/> | 43 <data format="tsv" name="outputPath"/> |
44 </outputs> | 44 </outputs> |
45 <tests> | 45 <tests> |
46 <test> | 46 <test> |
47 | |
48 | |
49 | |
50 | |
51 | |
52 | |
53 | |
54 | |
55 | |
56 | |
57 | |
58 <param name="inputPath" value="XF_network.sbml"/> | 47 <param name="inputPath" value="XF_network.sbml"/> |
59 | |
60 | |
61 | |
62 | |
63 | |
64 | |
65 | |
66 | |
67 | |
68 | |
69 | |
70 <param name="source" value="true"/> | 48 <param name="source" value="true"/> |
71 | |
72 | |
73 | |
74 | |
75 | |
76 | |
77 | |
78 | |
79 | |
80 | |
81 | |
82 <output ftype="tsv" name="outputPath"> | 49 <output ftype="tsv" name="outputPath"> |
83 | |
84 | |
85 | |
86 | |
87 | |
88 | |
89 | |
90 | |
91 | |
92 | |
93 | |
94 <assert_contents> | 50 <assert_contents> |
95 | |
96 | |
97 | |
98 | |
99 | |
100 | |
101 | |
102 | |
103 | |
104 | |
105 | |
106 <has_n_columns n="1"/> | 51 <has_n_columns n="1"/> |
107 | |
108 | |
109 | |
110 | |
111 | |
112 | |
113 | |
114 | |
115 | |
116 | |
117 | |
118 <has_n_lines n="109"/> | 52 <has_n_lines n="109"/> |
119 | |
120 | |
121 | |
122 | |
123 | |
124 | |
125 | |
126 | |
127 | |
128 | |
129 | |
130 <has_line_matching expression="M_\S+_\w" n="109"/> | 53 <has_line_matching expression="M_\S+_\w" n="109"/> |
131 | |
132 | |
133 | |
134 | |
135 | |
136 | |
137 | |
138 | |
139 | |
140 | |
141 | |
142 </assert_contents> | 54 </assert_contents> |
143 | |
144 | |
145 | |
146 | |
147 | |
148 | |
149 | |
150 | |
151 | |
152 | |
153 | |
154 </output> | 55 </output> |
155 | |
156 | |
157 | |
158 | |
159 | |
160 | |
161 | |
162 | |
163 | |
164 | |
165 | |
166 </test> | 56 </test> |
167 <test> | 57 <test> |
168 | |
169 | |
170 | |
171 | |
172 | |
173 | |
174 | |
175 | |
176 | |
177 | |
178 | |
179 <param name="inputPath" value="XF_network.sbml"/> | 58 <param name="inputPath" value="XF_network.sbml"/> |
180 | |
181 | |
182 | |
183 | |
184 | |
185 | |
186 | |
187 | |
188 | |
189 | |
190 | |
191 <param name="sink" value="true"/> | 59 <param name="sink" value="true"/> |
192 | |
193 | |
194 | |
195 | |
196 | |
197 | |
198 | |
199 | |
200 | |
201 | |
202 | |
203 <param name="useInternal" value="true"/> | 60 <param name="useInternal" value="true"/> |
204 | |
205 | |
206 | |
207 | |
208 | |
209 | |
210 | |
211 | |
212 | |
213 | |
214 | |
215 <param name="comp" value="e"/> | 61 <param name="comp" value="e"/> |
216 | |
217 | |
218 | |
219 | |
220 | |
221 | |
222 | |
223 | |
224 | |
225 | |
226 | |
227 <output ftype="tsv" name="outputPath"> | 62 <output ftype="tsv" name="outputPath"> |
228 | |
229 | |
230 | |
231 | |
232 | |
233 | |
234 | |
235 | |
236 | |
237 | |
238 | |
239 <assert_contents> | 63 <assert_contents> |
240 | |
241 | |
242 | |
243 | |
244 | |
245 | |
246 | |
247 | |
248 | |
249 | |
250 | |
251 <has_n_columns n="1"/> | 64 <has_n_columns n="1"/> |
252 | |
253 | |
254 | |
255 | |
256 | |
257 | |
258 | |
259 | |
260 | |
261 | |
262 | |
263 <has_n_lines n="5"/> | 65 <has_n_lines n="5"/> |
264 | |
265 | |
266 | |
267 | |
268 | |
269 | |
270 | |
271 | |
272 | |
273 | |
274 | |
275 <has_line_matching expression="^M_\S+_\w" n="5"/> | 66 <has_line_matching expression="^M_\S+_\w" n="5"/> |
276 | |
277 | |
278 | |
279 | |
280 | |
281 | |
282 | |
283 | |
284 | |
285 | |
286 | |
287 </assert_contents> | 67 </assert_contents> |
288 | |
289 | |
290 | |
291 | |
292 | |
293 | |
294 | |
295 | |
296 | |
297 | |
298 | |
299 </output> | 68 </output> |
300 | |
301 | |
302 | |
303 | |
304 | |
305 | |
306 | |
307 | |
308 | |
309 | |
310 | |
311 </test> | 69 </test> |
312 <test> | 70 <test> |
313 | |
314 | |
315 | |
316 | |
317 | |
318 | |
319 | |
320 | |
321 | |
322 | |
323 | |
324 <param name="inputPath" value="XF_network.sbml"/> | 71 <param name="inputPath" value="XF_network.sbml"/> |
325 | |
326 | |
327 | |
328 | |
329 | |
330 | |
331 | |
332 | |
333 | |
334 | |
335 | |
336 <param name="sink" value="true"/> | 72 <param name="sink" value="true"/> |
337 | |
338 | |
339 | |
340 | |
341 | |
342 | |
343 | |
344 | |
345 | |
346 | |
347 | |
348 <param name="useBorensteinAlg" value="true"/> | 73 <param name="useBorensteinAlg" value="true"/> |
349 | |
350 | |
351 | |
352 | |
353 | |
354 | |
355 | |
356 | |
357 | |
358 | |
359 | |
360 <param name="comp" value="e"/> | 74 <param name="comp" value="e"/> |
361 | |
362 | |
363 | |
364 | |
365 | |
366 | |
367 | |
368 | |
369 | |
370 | |
371 | |
372 <output ftype="tsv" name="outputPath"> | 75 <output ftype="tsv" name="outputPath"> |
373 | |
374 | |
375 | |
376 | |
377 | |
378 | |
379 | |
380 | |
381 | |
382 | |
383 | |
384 <assert_contents> | 76 <assert_contents> |
385 | |
386 | |
387 | |
388 | |
389 | |
390 | |
391 | |
392 | |
393 | |
394 | |
395 | |
396 <has_n_columns n="1"/> | 77 <has_n_columns n="1"/> |
397 | |
398 | |
399 | |
400 | |
401 | |
402 | |
403 | |
404 | |
405 | |
406 | |
407 | |
408 <has_n_lines n="26"/> | 78 <has_n_lines n="26"/> |
409 | |
410 | |
411 | |
412 | |
413 | |
414 | |
415 | |
416 | |
417 | |
418 | |
419 | |
420 <has_line_matching expression="^M_\S+_\w" n="26"/> | 79 <has_line_matching expression="^M_\S+_\w" n="26"/> |
421 | |
422 | |
423 | |
424 | |
425 | |
426 | |
427 | |
428 | |
429 | |
430 | |
431 | |
432 </assert_contents> | 80 </assert_contents> |
433 | |
434 | |
435 | |
436 | |
437 | |
438 | |
439 | |
440 | |
441 | |
442 | |
443 | |
444 </output> | 81 </output> |
445 | |
446 | |
447 | |
448 | |
449 | |
450 | |
451 | |
452 | |
453 | |
454 | |
455 | |
456 </test> | 82 </test> |
457 </tests> | 83 </tests> |
458 <help><![CDATA[Identify exogenously acquired compounds, exogenously available producible compounds and/or dead ends metabolites from metabolic network topology | 84 <help><![CDATA[Identify exogenously acquired compounds, exogenously available producible compounds and/or dead ends metabolites from metabolic network topology |
459 Metabolic seeds and targets are useful for identifying medium requirements and metabolic capability, and thus enable analysis of metabolic ties within communities of organisms. | 85 Metabolic seeds and targets are useful for identifying medium requirements and metabolic capability, and thus enable analysis of metabolic ties within communities of organisms. |
460 This application can use seed definition and SCC-based detection algorithm by Borenstein et al. or, alternatively, degree-based sink and source detection with compartment adjustment. | 86 This application can use seed definition and SCC-based detection algorithm by Borenstein et al. or, alternatively, degree-based sink and source detection with compartment adjustment. |