--- a/tools/networkAnalysis/BipartiteDistanceMatrix/BipartiteDistanceMatrix.xml	Wed Jul 26 15:33:45 2023 +0000
+++ b/tools/networkAnalysis/BipartiteDistanceMatrix/BipartiteDistanceMatrix.xml	Fri Jan 31 18:28:53 2025 +0000
@@ -1,11 +1,11 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<tool id="met4j_BipartiteDistanceMatrix" name="BipartiteDistanceMatrix" version="MET4J_VERSION_TEST">
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<tool id="met4j_BipartiteDistanceMatrix" name="BipartiteDistanceMatrix" version="develop">
   <description>Create a compound to reactions distance matrix.</description>
   <xrefs>
     <xref type="bio.tools">met4j</xref>
   </xrefs>
   <requirements>
-    <container type="singularity">oras://registry.forgemia.inra.fr/metexplore/met4j/met4j-singularity:MET4J_VERSION_TEST</container>
+    <container type="singularity">oras://registry.forgemia.inra.fr/metexplore/met4j/met4j-singularity:develop</container>
   </requirements>
   <command detect_errors="exit_code"><![CDATA[sh /usr/bin/met4j.sh networkAnalysis.BipartiteDistanceMatrix -i "$inputPath"
 #if str($sideCompoundFile) != 'None':
@@ -42,7 +42,7 @@
   </outputs>
   <tests/>
   <help><![CDATA[Create a compound to reactions distance matrix.
-The distance between two nodes (metabolite or reaction) is computed as the length of the shortest path connecting the two in the bipartite graph, Bipartite graph are composed of two distinct sets of nodes and two nodes can be linked only if they are from distinct sets.
+The distance between two nodes (metabolite or reaction) is computed as the length of the shortest path connecting the two in the bipartite graph, Bipartite graphs are composed of two distinct sets of nodes and two nodes can be linked only if they are from distinct sets.
 Therefore a metabolite node can be linked to a reaction node if the metabolite is a substrate or product of the reaction.
 An optional custom 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.Custom weighting can be provided in a file. In that case, edges without weight are ignored during path search.
 If no edge weighting is set, it is recommended to provide a list of side compounds to ignore during network traversal.]]></help>