--- a/build/tools/DegreeWeighting/DegreeWeighting.xml	Wed Jul 26 15:33:45 2023 +0000
+++ b/build/tools/DegreeWeighting/DegreeWeighting.xml	Fri Jan 31 18:28:53 2025 +0000
@@ -1,11 +1,11 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<tool id="met4j_DegreeWeighting" name="DegreeWeighting" version="1.5.0">
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<tool id="met4j_DegreeWeighting" name="DegreeWeighting" version="develop">
   <description>Provides tabulated compound graph edge list, with one column with target's degree.</description>
   <xrefs>
     <xref type="bio.tools">met4j</xref>
   </xrefs>
   <requirements>
-    <container type="singularity">oras://registry.forgemia.inra.fr/metexplore/met4j/met4j-singularity:1.5.0</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.DegreeWeighting#if str($pow):
  -pow "$pow"
@@ -45,6 +45,8 @@
     <data format="tsv" name="outputPath"/>
   </outputs>
   <tests/>
-  <help><![CDATA[Provides tabulated compound graph edge list, with one column with target's degree.Degree has been proposed as edge weight for finding meaningful paths in metabolic networks, using shortest (lightest) path search. See Croes et al. 2006 (https://doi.org/10.1016/j.jmb.2005.09.079) and Croes et al. 2005 (https://doi.org/10.1093/nar/gki437)]]></help>
-  <citations/>
+  <help><![CDATA[Provides tabulated compound graph edge list, with one column with target's degree.Degree has been proposed as edge weight for finding meaningful paths in metabolic networks, using shortest (lightest) path search.]]></help>
+  <citations>
+    <citation type="doi">10.1016/j.jmb.2005.09.079</citation>
+  </citations>
 </tool>