openmedical/registry
← registry

mccortex

imported

software/mccortex

De novo genome assembly and multisample variant calling

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

record
Category
Software & Systems
Subcategory
unknown
License
MIT(osi)
Status
dormant
Maturity
deployed
Organization
mcveanlab
Country
unknown
Documentation
unknown
Tags
contigs · cortex · de-bruijn-graphs · genome-analysis · genome-assembly · genome-graph · genomics · kmer
Regulatory
unknown
built by · 4

Top contributors by commit count, from the project’s public repository. Avatars are served by their origin, not stored here. To be removed from this list, open an issue.

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.

  • minigraphgenome-graph · genomics

    Sequence-to-graph mapper and graph generator

  • Genome-on-Dietgenome-analysis · genomics

    Genome-on-Diet is a fast and memory-frugal framework for exemplifying sparsified genomics for read mapping, containment search, and metagenomic profiling. It is much faster & more memory-efficient…

  • hgvsgenome-analysis · genomics

    Python library to parse, format, validate, normalize, and map sequence variants according to HGVS Nomenclature (https://hgvs-nomenclature.org/).

  • smudgeplotgenomics · kmer

    Inference of ploidy and heterozygosity structure using whole genome sequencing data

  • tiptoftgenomics · kmer

    Predict plasmids from uncorrected long read data

  • wallycontigs · genomics

    Wally: Visualization of aligned sequencing reads and contigs

sources
  1. api.github.com/repos/mcveanlab/mccortex
    retrieved 2026-08-05 · via github-api

    Machine-imported from GitHub search. Last push 2019-03-28, 113 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/48.json→ .entries["mccortex"]

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