Exclusion-based parentage assignment is essential for studies in biodiversity conservation and breeding programs - Kang Huang, Rui Mi, Derek W Dunn, Tongcheng Wang, Baoguo Li, (2018), <doi:10.1534/genetics.118.301592>. The tool compares multilocus genotype data of potential parents and offspring, identifying likely parentage relationships while accounting for genotyping errors, missing data, and duplicate genotypes. 'acoRn' includes two algorithms: one generates synthetic genotype data based on user-defined parameters, while the other analyzes existing genotype data to identify parentage patterns. The package is versatile, applicable to diverse organisms, and offers clear visual outputs, making it a valuable resource for researchers.

Analysis of count data exhibiting autoregressive properties, using the Autoregressive Conditional Poisson model (ACP(p,q)) proposed by Heinen (2003).

A Tool for Semi-Automating the Statistical Disclosure Control of Research Outputs.

A tool for generating acronyms and initialisms from arbitrary text input.

Main functionality is to provide the algorithmic complexity for
    short strings, an approximation of the Kolmogorov Complexity of a short
    string using the coding theorem method (see ?acss). The database containing
    the complexity is provided in the data only package acss.data, this package
    provides functions accessing the data such as prob_random returning the
    posterior probability that a given string was produced by a random process.
    In addition, two traditional (but problematic) measures of complexity are
    also provided: entropy and change complexity.

Data only package providing the algorithmic complexity of short strings, computed using the coding theorem method. For a given set of symbols in a string, all possible or a large number of random samples of Turing machines (TM) with a given number of states (e.g., 5) and number of symbols corresponding to the number of symbols in the strings were simulated until they reached a halting state or failed to end. This package contains data on 4.5 million strings from length 1 to 12 simulated on TMs with 2, 4, 5, 6, and 9 symbols. The complexity of the string corresponds to the distribution of the halting states of the TMs.