Search Results for "parallel genetic algorithm"
Sort By:
Showing 32 open source projects for "parallel genetic algorithm"
View related business solutions-
Field Sales+ for MS Dynamics 365 and SalesforceBring Dynamics 365 and Salesforce wherever you go with Resco’s solution. With powerful offline features and reliable data syncing, your team can access CRM data on mobile devices anytime, anywhere. This saves time, cuts errors, and speeds up customer visits.
-
Rezku Point of SaleRezku is an all-inclusive ordering platform and management solution for all types of restaurant and bar concepts. You can now get a fully custom branded downloadable smartphone ordering app for your restaurant exclusively from Rezku.
-
1
Mendel’s Accountant is a biologically realistic, forward-time, parallel, numerical simulation program which models genetic change within a population, as affected by mutation and selection.
-
2
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. ...
-
3
PF_HP
Prediction of proteinfolding in 2D HP model
Even in the simplified two dimensional HP-model (hydrophob/polar) the prediction of proteinfolding is NP complete. We implement a brute force algorithm with serial and parallel execution to solve short inputs of HP sequences (0-1 bitstrings). Selbst im vereinfachten zweidimensionalen HP-Modell (hydrophob/polar) ist die Proteinfaltung bereits NP-vollständig. Hier implementieren wir einen brute-force Algorithmus zur Lösung kurzer Eingabesequenzen (0-1-Bitstrings) für die Proteinfaltung. ... -
4
GenCodeGenerator
C++ class to generate biologically plausible genetic codes
...By default, the class "GeneticCode" generates alternative genetic codes, with the reqirement of block structure, and, optionally, with the assumption of stereochemical or biosynthetic models (to impose the assumption of the adaptive model, simply filter the codes using the error_cost() function). See Appendix in Makukov & shCherbak (2017) for the description of the algorithm. The code requires Qt 5. -
Collect! is a highly configurable debt collection softwareThe flexible & scalable debt collection software built to automate your workflow. From startup to enterprise, we have the solution for you.
-
5
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. -
6
SWAPHI-LS: Alignment on Xeon Phi Cluster
Smith-Waterman long DNA sequence alignment on Xeon Phi clusters
The first parallel Smith-Waterman algorithm exploiting Intel Xeon Phi clusters to accelerate the alignment of long DNA sequences. This algorithm is written in C++ (with a set of SIMD intrinsic extensions), OpenMP and MPI. The performance evaluation revealed that our algorithm achieves very stable performance, and yields a performance of up to 30.1 GCUPS on a single Xeon Phi and up to 111.4 GCUPS on four Xeon Phis sharing a host. -
7
SWAPHI: Smith-Waterman on Intel Xeon Phi
The first protein sequence database search on shared-host Xeon Phis
The first parallel algorithm to accelerate the Smith-Waterman protein database search on shared-host multiple Intel Xeon Phi coprocessors. By searching against the UniProtKB/TrEMBL database, SWAPHI achieves a performance of up to 58.8 billion cell updates per second (GCUPS) on a single Xeon Phi and up to 228.4 GCUPS on four Xeon Phis. -
8
CUDAlign
CUDAlign is a tool that aligns huge DNA sequences in CUDA capable GPUs
...IEEE Transactions on Parallel and Distributed Systems, vol. 99, PrePrints, 2012 [2] Edans Sandes, Alba Melo. Smith-Waterman Alignment of Huge Sequences with GPU in Linear Space. IPDPS 2011: 1199-1211 [3] Edans Sandes, Alba Melo. CUDAlign: using GPU to accelerate the comparison of megabase genomic sequences. PPOPP 2010: 137-146 The latest source code can be found in Github. -
9
Glycosylation Microviewer
An application create, simulate and adjust N-linked glycosylation.
...The model used in the application is based on two significant papers: 1.1997 Pablo Umana, James E.Bailey A Mathematical Model of N-linked Glycoform Biosynthesis. 2.2005 Frederick J.Krambeck, Michael J.Betenbaugh A Mathematical Model of N-linked Glycosylation. The application allow to simulate the network in dynamic form with various ODE solvers(Euler, Runge-Kutta etc). Genetic Algorithm is used to adjust the kinetic parameters of Michaelis-Menten equations in glycosylation reaction network. A dynamic plot is supplied to show the value of mole amout and mole fraction of various glycoform. Thanks to Alexey Balakin and Alessandro Presta. Alexey Balakin supply mathgl(https://sourceforge.net/projects/mathgl) that make the implementation of dynamic plot in this application easily. ... -
Skillfully - The future of skills based hiringSkillfully transforms hiring through AI-powered skill simulations that show you how candidates actually perform before you hire them. Our platform helps companies cut through AI-generated resumes and rehearsed interviews by validating real capabilities in action. Through dynamic job specific simulations and skill-based assessments, companies like Bloomberg and McKinsey have cut screening time by 50% while dramatically improving hire quality.
-
10
ESTReMo
An evolutionary simulator of transcription regulatory networks
ESTReMo is a genetic algorithm-based simulator to explore the evolution of transcription factors and their binding motifs on realistic genomic backgrounds. -
11
FamSeq
Variant calling on the basis of pedigree information
...FamSeq accommodates de novo mutations and can perform variant calling at chromosome X. To accommodate variations in data complexity, FamSeq consists of three distinct implementations of the Mendelian genetic model: the Bayesian network algorithm, Elston-Stewart algorithm and Markov chain Monte Carlo algorithm. To make the software efficient and applicable to large families, we parallelized the Bayesian network algorithm that copes with pedigrees with inbreeding loops without losing calculation precision on an NVIDIA® graphics processing unit. -
12
Ezys
Ezys 3D medical image registration program
Ezys is a non-linear 3D medical image registration program. Ezys fully exploits the parallel computing power of inexpensive commercial graphics processing units (GPU), resulting in a very fast and accurate program capable of running on desktop PCs and even some laptops. On these systems, non-linear image registrations take less than a minute to complete. Ezys implements a diffeomorphic inverse consistent image registration algorithm with a demons-style regularization based on a non-parametric free form deformation model. ... -
13
SimpleFB_GA
a simple genetic algorithm written in FreeBasic
a FreeBasic-written Genetic Algorithm code is here deployed -
14
GENIE (GEne-geNe IntEraction)
GPU based Parallel Gene-Gene Interaction Analysis
Gene-gene interaction in genetic association studies is computationally intensive when a large number of SNPs are involved. Most of the latest Central Processing Units (CPUs) have multiple cores, whereas Graphics Processing Units (GPUs) also have hundreds of cores and have been recently used to implement faster scientific software. However, currently there are no genetic analysis software packages that allow users to fully utilize the computing power of these multi-core devices for genetic... -
15
PPSeq: Parallel NGS Analysis
Parallel Processing for Next-Generation Sequencing (NGS) Analysis
High-throughput next generation sequencing (NGS) technology has quickly emerged as a powerful tool in many aspects of biomedical research. However, along with its rapid development, the data magnitude and analysis complexity for NGS far exceed the capacity and capability of traditional small-scale computing facilities, such as multithreading algorithms on standalone workstations. To address this issue, here we present a solution using the ever-increasing supply of processing power by massive... -
16
Darwin 2: Java Framework for Evolutionary Computation (genetic algorithm, GA). A true framework with out-of-the-box functionality and extensibility of all classes. Interface-based pattern with dependency-injection to configure components.
-
17
C++ software which implements serial and parallel Nullspace Algorithm based on algebraic rank test for the computation of elementary flux modes.
-
18
DecGPU: CUDA-based Error Correction
The first distributed and parallel short-read error corrector on GPUs
DecGPU (Distributed Error correction on GPUs) is a parallel and distributed error correction algorithm for large-scale short read assembly. It is implemented using CUDA C++ and MPI, running on a GPU cluster. -
19
CloudBurst is a parallel read-mapping algorithm optimized for mapping next-generation sequence data to the human genome and other reference genomes, for use in a variety of biological analyses including SNP discovery, genotyping, and personal genomics.
-
20
BIL++ is a set of standalone C++ packages for data processing in Bioinformatics (Graph mining, Bayesian networks, Genetic algorithm, Discretization, Gene expression data analysis, Hypothesis testing).
-
21
This project intends to create a bacteria simulator framework, with some realistic bacteria control methods based on chemical signaling, simple sensors, motors and neural networks. The bacteria will evolve in a genetic algorithm environment.
-
22
This library is a lightweight implementation of genetic algorithm, contains the most popular types of chromosomes and the basic algorithms for selection, elitism, crossing and mutation.
-
23
Shape is a molecular conformation prediction program. It uses a genetic algorithm to efficiently search the conformational space of a biomolecule and then clusters the results. It is very simple to use.
-
24
Java API for implementing any kind of Genetic Algorithm and Genetic Programming applications quickly and easily. Contains a wide range of ready-to-use GA and GP algorithms and operators to be plugged-in or extended. Includes Tutorials and Examples.
-
25
IU parallel fastDNAml is a program that infers evolutionary histories from genetic sequences, modified and extended from the serial version of fastDNAml to run in parallel on heterogeneous and widely distributed systems.
