Mercurial > repos > metexplore > met4j_distancematrix
comparison DistanceMatrix.xml @ 0:bafffac56b4f draft
planemo upload for repository https://forgemia.inra.fr/metexplore/met4j-galaxy commit e28ca123295d50b85ba872e5a4720fd72697ecc3
| author | metexplore |
|---|---|
| date | Thu, 13 Mar 2025 15:41:50 +0000 |
| parents | |
| children | c5d875dc43ae |
comparison
equal
deleted
inserted
replaced
| -1:000000000000 | 0:bafffac56b4f |
|---|---|
| 1 <?xml version="1.0" encoding="UTF-8" standalone="no"?> | |
| 2 <tool id="met4j_DistanceMatrix" name="DistanceMatrix" version="@TOOL_VERSION@"> | |
| 3 <description>Create a compound to compound distance matrix.</description> | |
| 4 <macros> | |
| 5 <import>macros.xml</import> | |
| 6 </macros> | |
| 7 <expand macro="bio_tools"/> | |
| 8 <expand macro="requirements"/> | |
| 9 <command detect_errors="exit_code"><![CDATA[met4j fr.inrae.toulouse.metexplore.met4j_toolbox.networkAnalysis.DistanceMatrix -i "$inputPath" | |
| 10 #if str($sideCompoundFile) != 'None': | |
| 11 -sc "$sideCompoundFile" | |
| 12 #end if | |
| 13 #if str($seedFile) != 'None': | |
| 14 -s "$seedFile" | |
| 15 #end if | |
| 16 $degree | |
| 17 #if str($weightFile) != 'None': | |
| 18 -w "$weightFile" | |
| 19 #end if | |
| 20 $undirected | |
| 21 -o "$outputPath" | |
| 22 ]]></command> | |
| 23 <inputs> | |
| 24 <param argument="-i" format="sbml" label="input SBML file" name="inputPath" optional="false" type="data" value=""/> | |
| 25 <param argument="-sc" format="txt" label="an optional file containing list of side compounds to ignore" name="sideCompoundFile" optional="true" type="data" value=""/> | |
| 26 <param argument="-s" format="txt" label="an optional file containing list of compounds of interest. The returned distance matrix contains only the corresponding rows and columns" name="seedFile" optional="true" type="data" value=""/> | |
| 27 <param argument="-dw" checked="false" falsevalue="" label="penalize traversal of hubs by using degree square weighting (-w must not be set)" name="degree" truevalue="-dw" type="boolean" value="false"/> | |
| 28 <param argument="-w" format="tsv" label="an optional file containing weights for compound pairs" name="weightFile" optional="true" type="data" value=""/> | |
| 29 <param argument="-u" checked="false" falsevalue="" label="Ignore reaction direction" name="undirected" truevalue="-u" type="boolean" value="false"/> | |
| 30 </inputs> | |
| 31 <outputs> | |
| 32 <data format="csv" name="outputPath"/> | |
| 33 </outputs> | |
| 34 <tests> | |
| 35 <test> | |
| 36 <param name="inputPath" value="toy_model.xml"/> | |
| 37 <output ftype="csv" name="outputPath"> | |
| 38 <assert_contents> | |
| 39 <has_n_lines n="9"/> | |
| 40 <has_line_matching expression="id,A,A_ext,B,C,D,D_ext,E,E_ext" n="1"/> | |
| 41 <has_line_matching expression="B,1.0,Infinity,0.0,2.0,1.0,2.0,Infinity,Infinity" n="1"/> | |
| 42 </assert_contents> | |
| 43 </output> | |
| 44 </test> | |
| 45 <test> | |
| 46 <param name="inputPath" value="toy_model.xml"/> | |
| 47 <param name="sideCompoundFile" value="sides.txt"/> | |
| 48 <param name="degree" value="true"/> | |
| 49 <param name="undirected" value="true"/> | |
| 50 <output ftype="csv" name="outputPath"> | |
| 51 <assert_contents> | |
| 52 <has_n_lines n="8"/> | |
| 53 <has_line_matching expression="id,A,B,C,D,D_ext,E,E_ext" n="1"/> | |
| 54 <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="B,4.0,0.0,8.0,16.0,17.0,20.0,21.0" n="1"/> | |
| 56 <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="D,8.0,4.0,4.0,0.0,1.0,4.0,5.0" n="1"/> | |
| 58 </assert_contents> | |
| 59 </output> | |
| 60 </test> | |
| 61 </tests> | |
| 62 <help><![CDATA[Create a compound to compound distance matrix. | |
| 63 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 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 If no edge weighting is set, it is recommended to provide a list of side compounds to ignore during network traversal. | |
| 66 @ATTRIBUTION@]]></help> | |
| 67 <citations/> | |
| 68 </tool> |
