mhap
locality-sensitive hashing to detect long-read overlaps
The MinHash Alignment Process (MHAP--pronounced MAP) is a
reference implementation of a probabilistic sequence overlapping
algorithm. Designed to efficiently detect all overlaps between noisy
long-read sequence data. It efficiently estimates Jaccard similarity
by compressing sequences to their representative fingerprints
composed on min-mers (minimum k-mer).
fonts-babelstone-modern
BabelStone latin modern font
BabelStone latin modern font for Western Latin character sets.
libdex-java
Dalvik Executable Java library - Transitional dummy package
This package is transitional and can be safely removed.
r-cran-survminer
Drawing Survival Curves using 'ggplot2'
Contains the function 'ggsurvplot()' for drawing easily beautiful and
'ready-to-publish' survival curves with the 'number at risk' table and
'censoring count plot'. Other functions are also available to plot adjusted
curves for `Cox` model and to visually examine 'Cox' model assumptions.
libgnatcoll-postgres2
Ada library accessing PostGreSQL databases (runtime)
The gnatcoll-db library allows Ada programs to send SQL queries to
SQLite or PostGreSQL databases.
libcvc4-7
automated theorem prover for SMT problems (runtime)
CVC4 is an efficient automatic theorem prover for satisfiability
modulo theories (SMT) problems. It can be used to prove the validity
(or, dually, the satisfiability) of first-order formulas in a large
number of built-in logical theories and their combination.