Provide easy methods to translate pieces of text.
  Functions send requests to translation services online.

Infer the genetic composition of individuals
    in terms of haplotype dosages for a haploblock, based
    on bi-allelic marker dosages, for any ploidy level.
    Reference: Voorrips and Tumino: PolyHaplotyper: haplotyping in polyploids based on bi-allelic marker dosage data.
    Submitted to BMC Bioinformatics (2021).

Kernel density estimation on the polysphere, (hyper)sphere, and
    circle. Includes functions for density estimation, regression estimation,
    ridge estimation, bandwidth selection, kernels, samplers, and homogeneity
    tests. Companion package to García-Portugués and Meilán-Vila (2025)
    <doi:10.1080/01621459.2025.2521898> and García-Portugués and Meilán-Vila
    (2023) <doi:10.1007/978-3-031-32729-2_4>.

A wrapper around the C++ library 'polylabel' from 'Mapbox',
    providing an efficient routine for finding the approximate pole of
    inaccessibility of a polygon, which usually serves as an excellent candidate
    for labeling of a polygon.

Creation of linkage maps in polyploid species from marker dosage
    scores of an F1 cross from two heterozygous parents. Currently works for outcrossing diploid, autotriploid, autotetraploid and autohexaploid species, 
    as well as segmental allotetraploids. Methods are described in a manuscript of Bourke et al. (2018) <doi:10.1093/bioinformatics/bty371>. Since version 1.1.0,
    both discrete and probabilistic genotypes are acceptable input; for more details on the latter see Liao et al. (2021) <doi:10.1007/s00122-021-03834-x>.

Includes functions implementing the conditionally optimal matching algorithm, 
    which can be used to generate matched samples in designs with multiple groups. The algorithm
    is described in Nattino, Song and Lu (2022) <doi:10.1016/j.csda.2021.107364>.

Implementation of class "polyMatrix" for storing a matrix of polynomials and implements 
  basic matrix operations; including a determinant and characteristic polynomial.
  It is based on the package 'polynom' and uses a lot of its methods to implement matrix operations.
  This package includes 3 methods of triangularization of polynomial matrices:
  Extended Euclidean algorithm which is most classical but numerically unstable;
  Sylvester algorithm based on LQ decomposition;
  Interpolation algorithm is based on LQ decomposition and Newton interpolation.
  Both methods are described in 
  D. Henrion & M. Sebek, Reliable numerical methods for polynomial matrix triangularization,
  IEEE Transactions on Automatic Control (Volume 44, Issue 3, Mar 1999, Pages 497-508) <doi:10.1109/9.751344>
  and in 
  Salah Labhalla, Henri Lombardi & Roger Marlin, 
  Algorithmes de calcule de la reduction de Hermite d'une matrice a coefficients polynomeaux,
  Theoretical Computer Science (Volume 161, Issue 1-2, July 1996, Pages 69-92) <doi:10.1016/0304-3975(95)00090-9>.