
slurmR - A Lightweight Wrapper for 'Slurm'
'Slurm', Simple Linux Utility for Resource Management <https://slurm.schedmd.com/>, is a popular 'Linux' based software used to schedule jobs in 'HPC' (High Performance Computing) clusters. This R package provides a specialized lightweight wrapper of 'Slurm' with a syntax similar to that found in the 'parallel' R package. The package also includes a method for creating socket cluster objects spanning multiple nodes that can be used with the 'parallel' package.
Last updated
bioinformaticshpcslurm
7.63 score 61 stars 232 scripts 277 downloadspartition - Agglomerative Partitioning Framework for Dimension Reduction
A fast and flexible framework for agglomerative partitioning. 'partition' uses an approach called Direct-Measure-Reduce to create new variables that maintain the user-specified minimum level of information. Each reduced variable is also interpretable: the original variables map to one and only one variable in the reduced data set. 'partition' is flexible, as well: how variables are selected to reduce, how information loss is measured, and the way data is reduced can all be customized. 'partition' is based on the Partition framework discussed in Millstein et al. (2020) <doi:10.1093/bioinformatics/btz661>.
Last updated
data-reductiondimensionality-reductionpartitional-clusteringopenblascpp
7.29 score 37 stars 1 dependents 29 scripts 216 downloadsfmcmc - A friendly MCMC framework
Provides a friendly (flexible) Markov Chain Monte Carlo (MCMC) framework for implementing Metropolis-Hastings algorithm in a modular way allowing users to specify automatic convergence checker, personalized transition kernels, and out-of-the-box multiple MCMC chains using parallel computing. Most of the methods implemented in this package can be found in Brooks et al. (2011, ISBN 9781420079425). Among the methods included, we have: Haario (2001) <doi:10.1007/s11222-011-9269-5> Adaptive Metropolis, Vihola (2012) <doi:10.1007/s11222-011-9269-5> Robust Adaptive Metropolis, and Thawornwattana et al. (2018) <doi:10.1214/17-BA1084> Mirror transition kernels.
Last updated
adaptivebayesian-inferencemarkov-chain-monte-carlomcmcmetropolis-hastingsparallel-computing
7.22 score 16 stars 1 dependents 58 scripts 319 downloadsaphylo - Statistical Inference and Prediction of Annotations in Phylogenetic Trees
Implements a parsimonious evolutionary model to analyze and predict gene-functional annotations in phylogenetic trees as described in Vega Yon et al. (2021) <doi:10.1371/journal.pcbi.1007948>. Focusing on computational efficiency, 'aphylo' makes it possible to estimate pooled phylogenetic models, including thousands (hundreds) of annotations (trees) in the same run. The package also provides the tools for visualization of annotated phylogenies, calculation of posterior probabilities (prediction) and goodness-of-fit assessment featured in Vega Yon et al. (2021).
Last updated
annotationsinferencephylogeneticsrcpparmadillocpp
6.49 score 6 stars 104 scripts 646 downloadsHiLDA - Conducting statistical inference on comparing the mutational exposures of mutational signatures by using hierarchical latent Dirichlet allocation
A package built under the Bayesian framework of applying hierarchical latent Dirichlet allocation. It statistically tests whether the mutational exposures of mutational signatures (Shiraishi-model signatures) are different between two groups. The package also provides inference and visualization.
Last updated
softwaresomaticmutationsequencingstatisticalmethodbayesianmutational-signaturesrjagssomatic-mutationscppjags
5.56 score 3 stars 1 dependents 7 scripts 370 downloadsLUCIDus - Latent Unknown Clustering Integrating Multi-View Data
An implementation of the LUCID model (Peng (2019) <doi:10.1093/bioinformatics/btz667>). LUCID conducts integrated clustering using exposures, omics data (and outcome as an option). An EM algorithm is implemented to estimate MLE of the LUCID model. 'LUCIDus' features integrated variable selection, incorporation of missing omics data, bootstrap inference, prediction and visualization of the model.
Last updated
5.35 score 7 stars 32 scripts 609 downloads
xrnet - Hierarchical Regularized Regression
Fits hierarchical regularized regression models to incorporate potentially informative external data, Weaver and Lewinger (2019) <doi:10.21105/joss.01761>. Utilizes coordinate descent to efficiently fit regularized regression models both with and without external information with the most common penalties used in practice (i.e. ridge, lasso, elastic net). Support for standard R matrices, sparse matrices and big.matrix objects.
Last updated
cpp
4.65 score 10 stars 1 dependents 10 scripts 197 downloadsselectKSigs - Selecting the number of mutational signatures using a perplexity-based measure and cross-validation
A package to suggest the number of mutational signatures in a collection of somatic mutations using calculating the cross-validated perplexity score.
Last updated
softwaresomaticmutationsequencingstatisticalmethodclusteringmutational-signaturesrjagssomatic-mutationscppjags
4.08 score 3 stars 7 scripts 308 downloadsbarry - Your Go-to Motif Accountant
Provides the 'C++' header-only library 'barry' for use in R packages. 'barry' is a 'C++' template library for counting sufficient statistics on binary arrays and building discrete exponential-family models. It provides tools for sparse arrays, user-defined count statistics, support set constraints, power set generation, and includes modules for Discrete Exponential Family Models (DEFMs) and network statistics. By placing these headers in this package, we offer an efficient distribution system for CRAN as replication of this code in the sources of other packages is avoided. This package follows the same approach as the 'BH' package which provides 'Boost' headers for R packages.
Last updated
motifsr-libraryr-programmingstatistics
3.95 score 2 dependents 274 downloadsmethcon5 - Identify and Rank CpG DNA Methylation Conservation Along the Human Genome
Identify and rank CpG DNA methylation conservation along the human genome. Specifically it includes bootstrapping methods to provide ranking which should adjust for the differences in length as without it short regions tend to get higher conservation scores.
Last updated
2.70 score 6 scripts 179 downloads