kite-eating-tree
by kite-eating-tree (Organization)
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 |
|---|
| _r-mutex | 1.0.0 | A mutex package to ensure environment exclusivity between Anaconda r and MRO. | Mar 25, 2025 | BSD |
| mro-base | 3.4.3 | — | Mar 25, 2025 | — |
| mro-basics | 3.4.3 | — | Mar 25, 2025 | — |
| nlopt-static | 2.4.2 | nonlinear optimization library | Mar 25, 2025 | GNU Lesser General Public License (LGPL) |
| r | 3.4.3 | R is a free software environment for statistical computing and graphics. | Mar 25, 2025 | GPL-3.0 |
| r-acepack | 1.4.1 | Two nonparametric methods for multiple regression transform selection are provided. The first, Alternative Conditional Expectations (ACE), is an algorithm to find the fixed point of maximal correlation, i.e. it finds a set of transformed response variables that maximizes R^2 using smoothing functions [see Breiman, L., and J.H. Friedman. 1985. "Estimating Optimal Transformations for Multiple Regression and Correlation". Journal of the American Statistical Association. 80:580-598. <doi:10.1080/01621459.1985.10478157>]. Also included is the Additivity Variance Stabilization (AVAS) method which works better than ACE when correlation is low [see Tibshirani, R.. 1986. "Estimating Transformations for Regression via Additivity and Variance Stabilization". Journal of the American Statistical Association. 83:394-405. <doi:10.1080/01621459.1988.10478610>]. A good introduction to these two methods is in chapter 16 of Frank Harrel's "Regression Modeling Strategies" in the Springer Series in Statistics. | Mar 25, 2025 | MIT + file LICENSE |
| r-adgoftest | 0.3 | Anderson-Darling GoF test with p-value calculation based on Marsaglia's 2004 paper "Evaluating the Anderson-Darling Distribution" | Mar 25, 2025 | GPL |
| r-aer | 1.2_5 | Functions, data sets, examples, demos, and vignettes for the book Christian Kleiber and Achim Zeileis (2008), Applied Econometrics with R, Springer-Verlag, New York. ISBN 978-0-387-77316-2. (See the vignette "AER" for a package overview.) | Mar 25, 2025 | GPL-2 | GPL-3 |
| r-afex | 0.18_0 | Convenience functions for analyzing factorial experiments using ANOVA or mixed models. aov_ez(), aov_car(), and aov_4() allow specification of between, within (i.e., repeated-measures), or mixed between-within (i.e., split-plot) ANOVAs for data in long format (i.e., one observation per row), aggregating multiple observations per individual and cell of the design. mixed() fits mixed models using lme4::lmer() and computes p-values for all fixed effects using either Kenward-Roger or Satterthwaite approximation for degrees of freedom (LMM only), parametric bootstrap (LMMs and GLMMs), or likelihood ratio tests (LMMs and GLMMs). afex uses type 3 sums of squares as default (imitating commercial statistical software). | Mar 25, 2025 | GPL (>= 2) |
| r-anomalydetection | 1.0 | A technique for detecting anomalies in seasonal univariate time series. | Mar 25, 2025 | Apache License 2.0 |
| r-ape | 5.0 | Functions for reading, writing, plotting, and manipulating phylogenetic trees, analyses of comparative data in a phylogenetic framework, ancestral character analyses, analyses of diversification and macroevolution, computing distances from DNA sequences, reading and writing nucleotide sequences as well as importing from BioConductor, and several tools such as Mantel's test, generalized skyline plots, graphical exploration of phylogenetic data (alex, trex, kronoviz), estimation of absolute evolutionary rates and clock-like trees using mean path lengths and penalized likelihood, dating trees with non-contemporaneous sequences, translating DNA into AA sequences, and assessing sequence alignments. Phylogeny estimation can be done with the NJ, BIONJ, ME, MVR, SDM, and triangle methods, and several methods handling incomplete distance matrices (NJ*, BIONJ*, MVR*, and the corresponding triangle method). Some functions call external applications (PhyML, Clustal, T-Coffee, Muscle) whose results are returned into R. | Mar 25, 2025 | GPL (>= 2) |
| r-argparse | 1.1.0 | A command line parser to be used with Rscript to write "#!" shebang scripts that gracefully accept positional and optional arguments and automatically generate usage. | Mar 25, 2025 | GPL (>= 2) |
| r-assertthat | 0.2.0 | assertthat is an extension to stopifnot() that makes it easy to declare the pre and post conditions that you code should satisfy, while also producing friendly error messages so that your users know what they've done wrong. | Mar 25, 2025 | GPL-3 |
| r-backports | 1.1.2 | Implementations of functions which have been introduced in R since version 3.0.0. The backports are conditionally exported which results in R resolving the function names to the version shipped with R (if available) and uses the implemented backports as fallback. This way package developers can make use of the new functions without worrying about the minimum required R version. | Mar 25, 2025 | GPL-2 |
| r-base | 3.4.3 | R is a free software environment for statistical computing and graphics. | Mar 25, 2025 | GPL-3.0 |
| r-base64enc | 0.1_3 | This package provides tools for handling base64 encoding. It is more flexible than the orphaned base64 package. | Mar 25, 2025 | GPL-2 | GPL-3 |
| r-bcp | 4.0.0 | Provides an implementation of the Barry and Hartigan (1993) product partition model for the normal errors change point problem using Markov Chain Monte Carlo. It also extends the methodology to regression models on a connected graph (Wang and Emerson, 2015); this allows estimation of change point models with multivariate responses. Parallel MCMC, previously available in bcp v.3.0.0, is currently not implemented. | Mar 25, 2025 | GPL (>= 2) |
| r-bdsmatrix | 1.3_3 | This is a special case of sparse matrices, used by coxme. | Mar 25, 2025 | LGPL-2 |
| r-bestglm | 0.36 | Best subset glm using information criteria or cross-validation. | Mar 25, 2025 | GPL (>= 2) |
| r-bh | 1.65.0_1 | Boost provides free peer-reviewed portable C++ source libraries. A large part of Boost is provided as C++ template code which is resolved entirely at compile-time without linking. This package aims to provide the most useful subset of Boost libraries for template use among CRAN package. By placing these libraries in this package, we offer a more efficient distribution system for CRAN as replication of this code in the sources of other packages is avoided. As of release 1.65.0-1, the following Boost libraries are included: 'algorithm' 'align' 'any' 'atomic' 'bimap' 'bind' 'circular_buffer' 'concept' 'config' 'container' 'date'_'time' 'detail' 'dynamic_bitset' 'exception' 'filesystem' 'flyweight' 'foreach' 'functional' 'fusion' 'geometry' 'graph' 'heap' 'icl' 'integer' 'interprocess' 'intrusive' 'io' 'iostreams' 'iterator' 'math' 'move' 'mpl' 'multiprcecision' 'numeric' 'pending' 'phoenix' 'preprocessor' 'propery_tree' 'random' 'range' 'scope_exit' 'smart_ptr' 'sort' 'spirit' 'tuple' 'type_traits' 'typeof' 'unordered' 'utility' 'uuid'. | Mar 25, 2025 | BSL-1.0 |
| r-bindr | 0.1 | Provides a simple interface for creating active bindings where the bound function accepts additional arguments. | Mar 25, 2025 | MIT + file LICENSE |
| r-bindrcpp | 0.2 | Provides an easy way to fill an environment with active bindings that call a C++ function. | Mar 25, 2025 | MIT + file LICENSE |
| r-bit | 1.1_12 | bitmapped vectors of booleans (no NAs), coercion from and to logicals, integers and integer subscripts; fast boolean operators and fast summary statistics. With 'bit' vectors you can store true binary booleans {FALSE,TRUE} at the expense of 1 bit only, on a 32 bit architecture this means factor 32 less RAM and ~ factor 32 more speed on boolean operations. Due to overhead of R calls, actual speed gain depends on the size of the vector: expect gains for vectors of size > 10000 elements. Even for one-time boolean operations it can pay-off to convert to bit, the pay-off is obvious, when such components are used more than once. Reading from and writing to bit is approximately as fast as accessing standard logicals - mostly due to R's time for memory allocation. The package allows to work with pre-allocated memory for return values by calling .Call() directly: when evaluating the speed of C-access with pre-allocated vector memory, coping from bit to logical requires only 70% of the time for copying from logical to logical; and copying from logical to bit comes at a performance penalty of 150%. the package now contains further classes for representing logical selections: 'bitwhich' for very skewed selections and 'ri' for selecting ranges of values for chunked processing. All three index classes can be used for subsetting 'ff' objects (ff-2.1-0 and higher). | Mar 25, 2025 | GPL-2 |
| r-bit64 | 0.9_7 | Package 'bit64' provides serializable S3 atomic 64bit (signed) integers. These are useful for handling database keys and exact counting in +-2^63. WARNING: do not use them as replacement for 32bit integers, integer64 are not supported for subscripting by R-core and they have different semantics when combined with double, e.g. integer64 + double => integer64. Class integer64 can be used in vectors, matrices, arrays and data.frames. Methods are available for coercion from and to logicals, integers, doubles, characters and factors as well as many elementwise and summary functions. Many fast algorithmic operations such as 'match' and 'order' support inter- active data exploration and manipulation and optionally leverage caching. | Mar 25, 2025 | GPL-2 |
| r-bitops | 1.0_6 | Functions for bitwise operations on integer vectors. | Mar 25, 2025 | GPL (>= 2) |