Find open-source science resources
A directory of tools, AI models, datasets, and research resources for biotech, bioinformatics, and other scientific fields. Aggregated from curated GitHub awesome-lists, HuggingFace, bio.tools, Bioconductor, and more.
Filters
Health
Domain(1)
Language(1)
License
Source
Type
6 of 9,874 resources
LAML-Pro is an algorithm that jointly infers cell genotypes and cell lineage trees using Maximum Likelihood estimation, designed to correct for genotype errors inherent in single-cell lineage tracing data.
Fast and Accurate Genome-wide Phasing and Imputation in a Single Tool.
RUTH: Robust, flexible, and scalable tests for Hardy-Weinberg Equilibrium across diverse ancestries. ruth is a software to perform robust unified Hardy-Weinberg Equilbrium (HWE) tests for sequence-based genotypes under population structure. 'ruth' (Robust Unified Test for HWE) uses information from genotypes and principal components to perform either a likelihood ratio test or a score test to estimate variants' deviation from HWE after adjusting for population structure.
Graph realignment tools for structural variants.
Moment Estimators of Relatedness From Low-Depth Whole-Genome Sequencing Data.
lasso, group lasso and sparse-group lasso regularisation for linear regression models via proximal gradient descent. This package provides regularization paths for the lasso, group lasso, and sparse-group lasso. The underlying mathematical model is a mixed model, i.e., a model with fixed and random effects. (Whereas it is actually optional to include any fixed effect.). Lasso, Group Lasso, and Sparse-Group Lasso for Mixed Models. Proximal gradient descent solver for the operators lasso, group lasso, and sparse-group lasso. The implementation involves backtracking line search and warm starts. Input data needs to be clustered/grouped for the (sparse-)group lasso before calling these algorithms. The sparse-group lasso contains two penalty terms, which are combined via a mixing parameter 0 <= alpha <= 1. The lasso, group lasso, and sparse-group lasso are implemented via proximal gradient descent.