Search Results for "algorithms"
Sort By:
Showing 57 open source projects for "algorithms"
View related business solutions-
1
The Chemistry Development Kit (CDK) is a scientific, LGPL-ed library for bio- and cheminformatics and computational chemistry written in Java. The main home page of the CDK is now at: http://cdk.github.io
-
2
NOVA
Analysis and visualization of complexome profiling data.
NOVA is a program designed to analysis complexome profiling data (Heide et al., 2012). A graphical user interface (GUI) provides various visualization tools, such as heat maps and 2D plots. Several hierarchical clustering algorithms (e.g., single linkage, average linkage, Wards linkage), different distance measures (e.g., Euclidean distance, Manhattan distance, Pearson distance), and various normalization techniques are implemented. Many additional functions like zooming, searching for proteins, image export, and automatic file format recognition support intuitive handling for biologists. ... -
3
@Note2
@Note2 - A workbench for Biomedical Text Mining
Biomedical Text Mining (BioTM) is providing valuable approaches to the automated curation of scientific literature. -
4
The source code has been migrated and is now hosted on Github: https://github.com/jenetics/jenetics Jenetics is an advanced Genetic Algorithm, Evolutionary Algorithm and Genetic Programming library, respectively, written in modern day Java. It is designed with a clear separation of the several algorithm concepts, e. g. Gene, Chromosome, Genotype, Phenotype, Population and fitness Function. Jenetics allows you to minimize or maximize the given fitness function without tweaking it. In...
-
5
SMSD
SMSD is a Java based software library for calculating MCS.
SMSD is a Java based software library for calculating Maximum Common Subgraph (MCS) between small molecules. This will help us to find similarity/distance between two molecules. MCS is also used for screening drug like compounds by hitting molecules, which share common subgraph (substructure). -
6
N2A
Neurons to Algorithms - A neural modeling and simulation workbench
"Neurons to Algorithms" (N2A) is a language for modeling neural systems, along with a software tool for editing models and simulating them. N2A is currently "alpha" software. The download provided on SF is for convenience to those who wish to preview the software. Please see our site on github for development status. -
7
OpenChrom is a tool for gas chromatography and mass spectrometry. The focus is to handle data files from different GC/MS and GC/FID systems and vendors. Its functionality and algorithms can be extended using a flexible plugin approach, based on Eclipse RCP.
-
8
This site hosts the source code for C++ version of the Broker for SBW, NOM module, advanced simulation suite, analysis applications and model editors.
-
9
spectralHMM
A spectral method for inferring selection from time series data
***WARNING*** This software was migrated to: https://github.com/popgenmethods/spectralHMM Support and updates will only be available at this new address. This software implements the algorithms described in the following paper: Steinrücken, M., Bhaskar, A. and Song, Y.S. A novel spectral method for inferring general diploid selection from time series genetic data. Annals of Applied Statistics, Vol. 8, No. 4 (2014) 2203-2222 -
10
An open source workbench for chemo- and bioinformatics built on the Eclipse Rich Client Platform (RCP).
-
11
BABA stands for Basic-Algorithms-of-Bioinformatics Applet. This project aims to create a set of bioinformatic algorithms presented didactically. The algorithms available at the moment are: Needleman&Wunsch, Smith&Waterman, Four Russians and Nussinov.
-
12
owl reasoning over big biomedical data
A OWL reasoning framework for the analysis of big biomedical data
A general OWL reasoning framework for the analysis of big biomedical data and implement a MapReduce-based property chain reasoning prototype system. OWL reasoning method is ideally suitable for problems involved complex semantic associations because it is able to infer logical consequences based on a set of asserted rules or axioms. MapReduce framework isused to solve the problem of scalability. In our experiment, we focus on the discovery of associations between Traditional Chinese Medicine... -
13
GeneticAlgorithms
Framework for using the Genetic Algorithms optimization heuristic.
GeneticAlgorithms is a simple and lightweight framework to implement an optimization heuristic following the Genetic Algorithms model. A genetic algorithm mimics the natural processes of evolution, selection and "survival of the fittest". This framework is intuitive and good integrated with Java 1.5 SDK and later. -
14
JGAP is a Genetic Algorithms and Genetic Programming package written in Java. It is designed to require minimum effort to use, but is also designed to be highly modular. JGAP features grid functionality and a lot of examples. Many unit tests included. Legal notice/Impressum: Klaus Meffert An der Struth 25 D-65510 Idstein sourceforge <at> klausmeffert.de
-
15
SBSI (Systems Biology Software Infrastructure) is a suite of tools for systems biology, such as parallelized numerical algorithms, and a Java, Eclipse RCP based client for visualizing results, running simulations, and integrating SBML based plugins.
-
16
scipion-xmipp
Image processing framework to integrate EM software packages.
...Additionally, all steps are tracked and can be reproduced later on. Xmipp is a well-known package in the EM image processing. It is integrated into Scipion and contains the algorithms in the core libraries and command line programs. -
17
HRDAG
Framework for Hierarchical Graph Decomposition
This is a framework used to decompose hierarchical graphs, i.e.,graphs which were created from or contain a hierarchy of modules. Each module is reused several times in the hierarchy. This may be useful to reverse-engineer human constructs like electronic equipment, manufactured machines, or bureaucratic hierarchies; but also to decompose natural constructs like gene-relation or protein-relation nets. -
18
BiMS
BiMS (biclustering for mass spectrometry data) is a Java application d
BiMS (biclustering for mass spectrometry data) is a Java application designed to allow the application of biclustering algorithms to mass spectrometry datasets. Users can load their MS datasets and apply different clustering and biclustering algorithms (current version includes Bimax and BiBit). In adition, users can load raw datasets (in mzML or mzXML formats) and preprocess them using MALDIquant package and MassSpecWavelet. -
19
Luscinia is a program for archiving and analyzing field sound recordings (especially of animals). It incorporates an interface to a database, spectrogram measurement algorithms, sound comparison algorithms, and statistical analysis.
-
20
xAffect
Sensor Middleware
xAffect is a software framework for online recording, processing and storage of multi sensor data. It was developed at FZI Research Center for Information Technology, Karlsruhe, Germany. xAffect can be used as a flexible, customizable middleware between physiological sensors and applications which require online feature computation (e.g. biofeedback or affective computing). Moreover, it can also be used as a standalone application for data acquisition and visualization. -
21
Java Machine Learning Library is a library of machine learning algorithms and related datasets. Machine learning techniques include: clustering, classification, feature selection, regression, data pre-processing, ensemble learning, voting, ...
-
22
IQuant
A pipeline for quantitative proteomics based upon isobaric tags
IQuant is an automated pipeline for quantitative proteomics based upon isobaric tags. It integrates post-processing tool of protein identification and advanced statistical algorithms to process the MS/MS signals generated from the peptides labeled by isobaric tags for quantification. IQuant can run from a graphical user interface (GUI) as well as a command-line interface and work with both Windows and Linux system. This website contains the IQuant software, an example data labeled by iTRAQ-8plex for testing and a user's manual. ... -
23
This library aims to provide support for D-dimensional images in Java and to enable high-level implementation of algorithms in dimensionally-invariant manner. Major features: the dimensionality and the access to primitive data types are abstracted.
-
24
cmotif
A method for mining conditional phosphorylation motifs
Phosphorylation motifs represent position-specific amino acid patterns around the phosphorylation sites in the set of phosphopeptides. The discovery of phosphorylation motifs is a very valuable work in bioinformatics. Although several algorithms have been proposed to uncover phosphorylation motifs, the problem of efficiently discovering a set of significant motifs with sufficiently high coverage and non-redundancy still remains unsolved. In this paper, we propose an algorithm called C-Motif for a non-redundant identification of significant phosphorylation motifs. In tests with real data including both non-kinase-specific and kinase-specific phosphorylation data, the C-Motif algorithm successfully reports a relatively complete set of of conditional phosphorylation motifs efficiently. -
25
TreeLiker
TreeLiker is a collection of fast algorithms for working with complex
...In experiments with real-life data, the algorithms were shown to be able to construct complete non-redundant sets of patterns for chemical datasets involving several thousands of molecules as well as for comparably large datasets from genomics or proteomics. The included relational learning algorithms are tailored towards so-called tree-like features for which some otherwise very hard sub-problems (NP-hard) become tractable.
