AIDA is a system for discovering and disambiguating named entities (persons, organizations, ...) in text.
Computational Geometry Algorithms Library
ClausIE is an open information extractor which extracts relations and their arguments from natural language text. ClausIE exploits linguistic knowledge about the grammar of the English language to first detect clauses in an input sentence and to subsequently identify the type of each clause according to the grammatical function of its constituents. ClausIE is based on dependency parsing and a set of domain independent lexica. The extractor can be currently run under various settings.
Dipha provides algorithms for topological data analysis on distributed systems, including creation of cell complexes and computing persistence diagrams.
The EpiExplorer integrates multiple epigenetic and genetic annotations and
makes them explorable via an interactive interface.
FunSimMat is a comprehensive functional similarity database for proteins and protein families and a tool for easy and fast disease gene prioritization.
Geno2Pheno predicts phenotypic drug resistance of HIV and of Hepatitis B and C virus from the viral genome sequence.
C++ Class Library of Efficient Data Types and Algorithms
NEFI is an extendable computer vision tool for extracting networks from
images. It extracts network information in form of a weighted graph and
works for a wide range of input images such as: insect wings, leaf
venations, slime molds, mud cracks etc.
Tools for Reading, Writing, Manipulating and Viewing High-Dynamic Range (HDR) Images and Video Frames
Phat is a toolbox providing several algorithms and data structure for the computation of persistent homology.
RDF-3X is an RDF storage and retrieval system that achieves excellent performance by following a RISC-style design philosophy.
RnBeads is an R package for comprehensive analysis of DNA methylation data obtained with a wide variety of experimental protocols.
An Automated Reasoning Workbench.
SPASS+T is an extension of the superposition-based theorem prover SPASS that enlarges the reasoning capabilities of SPASS using some built-in arithmetic simplification rules and an arbitrary SMT procedure for arithmetic and free function symbols as a black-box.