Simulating and plotting taxonomy and fossil data on phylogenetic trees under mechanistic
    models of speciation, preservation and sampling.

A shiny application based on 'FossilSim'. Used for simulating
    tree, taxonomic and fossil data under mechanistic models of speciation,
    preservation and sampling.

A tool to use a principal component analysis on radially averaged
  two dimensional Fourier spectra to characterize image texture. The method
  within the context of ecology was first described by Couteron et al. (2005)
  <doi:10.1111/j.1365-2664.2005.01097.x> and expanded upon by
  Solorzano et al. (2018) <doi:10.1117/1.JRS.12.036006>
  using a moving window approach.

Interface to 'Palantir Foundry', including
    reading and writing structured or unstructured datasets, and more
    <https://www.palantir.com/platforms/foundry/>.

The four-gamete test is based on the infinite-sites model which assumes that the probability of the same mutation occurring twice (recurrent or parallel mutations) and the probability of a mutation back to the original state (reverse mutations) are close to zero. Without these types of mutations, the only explanation for observing the four dilocus genotypes (example below) is recombination (Hudson and Kaplan 1985, Genetics 111:147-164). Thus, the presence of all four gametes is also called phylogenetic incompatibility.

Computes Fourier integrals of functions of one and two variables using the Fast Fourier transform. The Fourier transforms must be evaluated on a regular grid for fast evaluation.

Estimate Barton & Lord's (1981) <doi:10.1002/j.2333-8504.1981.tb01255.x> 
    four parameter IRT model with lower and upper asymptotes using Bayesian
    formulation described by Culpepper (2016) <doi:10.1007/s11336-015-9477-6>.

A game for two players: Who gets first four in a row (horizontal, vertical or diagonal) wins. As board game published by Milton Bradley, designed by Howard Wexler and Ned Strongin.

Implements parsimonious hidden Markov models for four-way data via expectation-
    conditional maximization algorithm, as described in Tomarchio et al. (2020) <arXiv:2107.04330>.
    The matrix-variate normal distribution is used as emission distribution. For each hidden
    state, parsimony is reached via the eigen-decomposition of the covariance matrices of the
    emission distribution. This produces a family of 98 parsimonious hidden Markov models.