cerebis
by cerebis
Most Popular
Downloads
Usage Instructions
To install packages from this channel, use the channel temporarily with conda or add it to your .condarc file for configured ongoing access. Learn more
- Temporary
- Configured
Packages
| Name | Latest Version | Summary | Updated | License |
|---|
| recordclass | 0.14.3 | Mutable variants of tuple (mutabletuple) and collections.namedtuple (recordclass), which support assignments and more memory saving variants (dataobject, structclass, litelist, ...). | Mar 25, 2025 | MIT |
| jellyfish | 2.3.0 | Jellyfish is a tool for fast, memory-efficient counting of k-mers in DNA. A k-mer is a substring of length k, and counting the occurrences of all such substrings is a central step in many analyses of DNA sequence. This package also includes working Python bindings. | Mar 25, 2025 | GPL-3.0 |
| qc3c | v0.5 | Hi-C quality control | Mar 25, 2025 | GNU Affero General Public License v3.0 |
| leven | 1.0.4 | Levenshtein edit distance library | Mar 25, 2025 | UNKNOWN |
| json2html | 1.3.0 | Python wrapper to convert JSON into a human readable HTML Table representation. | Mar 25, 2025 | Copyright (c) 2013 Varun Malhotra |
| pysam | 0.16.0.1 | pysam | Mar 25, 2025 | MIT |
| polo | 7c1fe68 | Python Optimal Leaf Ordering for Hierarchical Clustering Polo is a python script to obtain optimal linear ordering of hierarchical clusters, using the algorithm described in Fast Optimal leaf ordering for hierarchical clustering, Bioinformatics 2001 by Ziv Bar-Joseph, David K. Gifford, Tommi S. Jaakkola. When a hierarchical cluster with n leaves is displayed as a dendrogram, there are 2^(n-1) possible trees to display. The optimal linear ordering is the one where the distance between successive leaves is minimized (even when the leaves come from different clusters). Here is an example of the default ordering obtaining from fastcluster's linkage function, compared to the optimal linear order. | Mar 25, 2025 | MIT License |