openmedical/registry
← registry

tmap2

imported

data/tmap2

Tree-based visualization for high-dimensional data. Organizes similar items into interactive tree structures for any high-dimensional dataset.

Machine-generated from the listed sources and not yet reviewed by a human.

tmap2 project image
GitHub preview card for afloresep/tmap2. Served by its origin, not stored here, and not covered by this registry’s licence.
record
Category
Data & Standards
Subcategory
unknown
License
MIT(osi)
Status
active
Maturity
deployed
Organization
unknown
Country
unknown
Documentation
unknown
Tags
high-dimensional-data · protein-structure · single-cell · visualization
Regulatory
unknown
similar by tags

Computed from shared tags, weighted so a rare tag counts for more than a common one. These are suggestions, not curated relationships.

  • uniCATEhigh-dimensional-data

    Univariate conditional average treatment effect estimation for predictive biomarker discovery

  • ASAPsingle-cell · visualization

    ASAP : Automated Single-cell Analysis Pipeline

  • dea_seuratsingle-cell · visualization

    A Snakemake workflow and MrBiomics module for performing differential expression analyses (DEA) on (multimodal) sc/snRNA-seq data powered by the R package Seurat.

  • dittoSeqsingle-cell · visualization

    Color blindness friendly visualization of single-cell and bulk RNA-sequencing data

  • MUDANsingle-cell · visualization

    Multi-sample Unified Discriminant ANalysis

  • scCustomizesingle-cell · visualization

    R package with collection of functions created and/or curated to aid in the visualization and analysis of single-cell data using R.

sources
  1. api.github.com/repos/afloresep/tmap2
    retrieved 2026-08-25 · via github-api

    Machine-imported from GitHub search. Last push 2026-08-24, 38 stars, license reported as MIT. Category and schematic were assigned by keyword heuristics and are unreviewed.

Not yet verified by a human. Correct this record →

machine-readable

/v1/entries/51.json→ .entries["tmap2"]

Entries are sharded 64 ways by a stable hash of the id, so a consumer can find any record without an index.