Mercurial > repos > ebi-gxa > scanpy_compute_graph

diff scanpy-neighbours.xml @ 28:6417cccad133 draft

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
planemo upload for repository https://github.com/ebi-gene-expression-group/container-galaxy-sc-tertiary/tree/develop/tools/tertiary-analysis/scanpy commit 6c9d530aa653101e9e21804393ec11f38cddf027-dirty
author ebi-gxa
date Thu, 16 Feb 2023 13:29:23 +0000
parents fcaa9048cdaf
children f776e3ed3c03
line wrap: on
line diff
--- a/scanpy-neighbours.xml	Thu Oct 28 09:58:45 2021 +0000
+++ b/scanpy-neighbours.xml	Thu Feb 16 13:29:23 2023 +0000
@@ -1,5 +1,5 @@
 <?xml version="1.0" encoding="utf-8"?>
-<tool id="scanpy_compute_graph" name="Scanpy ComputeGraph" version="@TOOL_VERSION@+galaxy0" profile="@PROFILE@">
+<tool id="scanpy_compute_graph" name="Scanpy ComputeGraph" version="@TOOL_VERSION@+galaxy9" profile="@PROFILE@">
   <description>to derive kNN graph</description>
   <macros>
     <import>scanpy_macros2.xml</import>
@@ -132,7 +132,7 @@
 
 The neighbor search efficiency of this heavily relies on UMAP (McInnes et al, 2018),
 which also provides a method for estimating connectivities of data points -
-the connectivity of the manifold (`method=='umap'`). If `method=='diffmap'`,
+the connectivity of the manifold (`method=='umap'`). If `method=='Gaussian'`,
 connectivities are computed according to Coifman et al (2005), in the adaption of
 Haghverdi et al (2016).