diff scran_normalize.xml @ 3:cc768b0f41cf draft default tip

planemo upload for repository https://github.com/ARTbio/tools-artbio/tree/main/tools/gsc_scran_normalize commit 9ab82433f375b37be5c9acb22e5deb798081dc3b

--- a/scran_normalize.xml	Sun Dec 10 00:27:45 2023 +0000
+++ b/scran_normalize.xml	Thu Nov 07 22:02:01 2024 +0000
@@ -1,5 +1,8 @@
-<tool id="scran_normalize" name="scran_normalize" version="1.28.1+galaxy0">
+<tool id="scran_normalize" name="scran_normalize" version="1.28.1+galaxy1">
     <description>Normalize raw counts expression values using deconvolution size factors</description>
+    <xrefs>
+        <xref type="bio.tools">galaxy_single_cell_suite</xref>
+    </xrefs>
     <requirements>
         <requirement type="package" version="1.28.1">bioconductor-scran</requirement>
         <requirement type="package" version="1.63_1">r-dynamictreecut</requirement>
@@ -71,8 +74,10 @@
 
 Cell-specific biases are normalized using the computeSumFactors method, which implements the
 deconvolution strategy for scaling normalization (A. T. Lun, Bach, and Marioni 2016). It creates a reference : 
-  - if no clustering step : the average count of all transcriptomes 
-  - if you choose to cluster your cells : the average count of each cluster. 
+
+- if no clustering step : the average count of all transcriptomes 
+- if you choose to cluster your cells : the average count of each cluster.
+
 Then it pools cells and then sum their expression profiles. The size factor is described as the median ration
 between the count sums and the average across all genes. Finally it constructs a linear distribution (deconvolution method)
 of size factors by taking multiple pools of cells.
@@ -80,9 +85,8 @@
 You can apply this method on cell cluster instead of your all set of cells by using quickCluster.
 It defines cluster using distances based on Spearman correlation on counts between cells, there is two available methods : 
 
-  - *hclust* : hierarchical clustering on the distance matrix and dynamic tree cut.
-  - *igraph* : constructs a Shared Nearest Neighbor graph (SNN) on the distance matrix and identifies highly connected communities.
-
+- *hclust* : hierarchical clustering on the distance matrix and dynamic tree cut.
+- *igraph* : constructs a Shared Nearest Neighbor graph (SNN) on the distance matrix and identifies highly connected communities.
 
 Note: First header row must NOT start with a '#' comment character