gaffitter

File subsets extractor based on genetic algorithms

Genetic Algorithm File Fitter (gaffitter) is a command-line software written in C++ that extracts --via genetic algorithm-- subsets of an input list of files/directories that best fit the given volume size (target), such as CD, DVD and others.

xinetd

replacement for inetd with many enhancements

xinetd has access control mechanisms, extensive logging capabilities, the ability to make services available based on time, and can place limits on the number of servers that can be started, among other things.

r-cran-ggseqlogo

GNU R ggplot2 extension for publication-ready sequence logos

The extensive range of functions provided by this package makes it possible to draw highly versatile sequence logos. Features include, but not limited to, modifying colour schemes and fonts used to draw the logo, generating multiple logo plots, and aiding the visualisation with annotations. Sequence logos can easily be combined with other plots 'ggplot2' plots.

r-cran-psyphy

functions for analyzing psychophysical data in GNU R

An assortment of functions that could be useful in analyzing data from psychophysical experiments. It includes functions for calculating d' from several different experimental designs, links for m-alternative forced- choice (mafc) data to be used with the binomial family in glm (and possibly other contexts) and self-Start functions for estimating gamma values for CRT screen calibrations.

dict-freedict-pol-fra

Polish-French dictionary for the dict server/client

This is the Polish-French dictionary from the FreeDict project. It contains 20847 headwords (FreeDict status: big enough to be useful). It can be either used with the dictd server and a dict client or with GoldenDict.

python3-treetime

inference of time stamped phylogenies and ancestral reconstruction (Python 3)

TreeTime provides routines for ancestral sequence reconstruction and the maximum likelihoo inference of molecular-clock phylogenies, i.e., a tree where all branches are scaled such that the locations of terminal nodes correspond to their sampling times and internal nodes are placed at the most likely time of divergence.