About Anaconda Help Download Anaconda

bioconda / packages

Package Name Access Summary Updated
bioconductor-spatialfeatureexperiment public Integrating SpatialExperiment with Simple Features in sf 2025-04-22
bioconductor-mobilitytransformr public Effective mobility scale transformation of CE-MS(/MS) data 2025-04-22
bioconductor-fusesom public A Correlation Based Multiview Self Organizing Maps Clustering For IMC Datasets 2025-04-22
bioconductor-scddboost public A compositional model to assess expression changes from single-cell rna-seq data 2025-04-22
bioconductor-spasim public Spatial point data simulator for tissue images 2025-04-22
bioconductor-beer public Bayesian Enrichment Estimation in R 2025-04-22
bioconductor-qmtools public Quantitative Metabolomics Data Processing Tools 2025-04-22
bioconductor-cnvmetrics public Copy Number Variant Metrics 2025-04-22
bioconductor-ggmanh public Visualization Tool for GWAS Result 2025-04-22
r-rspectral public Implements the network clustering algorithm described in Newman (2006) <doi:10.1103/PhysRevE.74.036104>. The complete iterative algorithm comprises of two steps. In the first step, the network is expressed in terms of its leading eigenvalue and eigenvector and recursively partition into two communities. Partitioning occurs if the maximum positive eigenvalue is greater than the tolerance (10e-5) for the current partition, and if it results in a positive contribution to the Modularity. Given an initial separation using the leading eigen step, 'rSpectral' then continues to maximise for the change in Modularity using a fine-tuning step - or variate thereof. The first stage here is to find the node which, when moved from one community to another, gives the maximum change in Modularity. This node’s community is then fixed and we repeat the process until all nodes have been moved. The whole process is repeated from this new state until the change in the Modularity, between the new and old state, is less than the predefined tolerance. A slight variant of the fine-tuning step, which can improve speed of the calculation, is also provided. Instead of moving each node into each community in turn, we only consider moves of neighbouring nodes, found in different communities, to the community of the current node of interest. The two steps process is repeatedly applied to each new community found, subdivided each community into two new communities, until we are unable to find any division that results in a positive change in Modularity. 2025-04-22
bioconductor-rolde public RolDE: Robust longitudinal Differential Expression 2025-04-22
bioconductor-compounddb public Creating and Using (Chemical) Compound Annotation Databases 2025-04-22
bioconductor-cellxgenedp public Discover and Access Single Cell Data Sets in the CELLxGENE Data Portal 2025-04-22
bioconductor-redisparam public Provide a 'redis' back-end for BiocParallel 2025-04-22
bioconductor-oncoscanr public Secondary analyses of CNV data (HRD and more) 2025-04-22
freddie public Annotation-independent detection of splicing isoforms using RNA long-reads 2025-04-22
bioconductor-biodbexpasy public biodbExpasy, a library for connecting to Expasy ENZYME database. 2025-04-22
bioconductor-biodbmirbase public biodbMirbase, a library for connecting to miRBase mature database 2025-04-22
bioconductor-biodbncbi public biodbNcbi, a library for connecting to NCBI Databases. 2025-04-22
massiveqc public Tools for QC massive RNA-seq samples 2025-04-22
bioconductor-cytomem public Marker Enrichment Modeling (MEM) 2025-04-22
haptools public Ancestry and haplotype aware simulation of genotypes and phenotypes for complex trait analysis 2025-04-22
bioconductor-stdeconvolve public Reference-free Cell-Type Deconvolution of Multi-Cellular Spatially Resolved Transcriptomics Data 2025-04-22
bioconductor-msbackendmsp public Mass Spectrometry Data Backend for NIST msp Files 2025-04-22
bioconductor-updateobject public Find/fix old serialized S4 instances 2025-04-22

© 2025 Anaconda, Inc. All Rights Reserved. (v4.2.2) Legal | Privacy Policy