Showing 281 open source projects for "genetic algorithm software"

View related business solutions
  • MongoDB Atlas runs apps anywhere Icon
    MongoDB Atlas runs apps anywhere

    Deploy in 115+ regions with the modern database for every enterprise.

    MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
    Start Free
  • Go From AI Idea to AI App Fast Icon
    Go From AI Idea to AI App Fast

    One platform to build, fine-tune, and deploy ML models. No MLOps team required.

    Access Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
    Try Free
  • 1
    AAARF, written in PERL and with numerous adjustable parameters, identifies sequence overlaps in small shotgun sequence datasets and walks them out to create long pseudomolecules representing the most abundant repeats in a genome.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    MassWiz

    MassWiz

    Proteomics MS/MS database search engine

    Open Source MS/MS algorithm with integrated target-decoy based FDR. Reference- http://pubs.acs.org/doi/abs/10.1021/pr200031z , Check out the wiki site for help and support - https://sourceforge.net/apps/mediawiki/masswiz/index.php?title=Main_Page
    Downloads: 5 This Week
    Last Update:
    See Project
  • 3

    NOFI ranking

    The Non-Outlier Fragment Ion ranking for enhaced DIA quantification

    The NOFI ranking algorithm has been developed to assign low priority to fragment ions affected by interference. The implementation is an R script that can be customized. A future version will contain a modular version. The outline is as follows: 1) The input contains the list of SWATH fragment ion XICs from the identified and quantified peptides by software tools such as Skyline and OpenSWATH. 2) The first step in NOFI is the computation of the 4 attributes (RTd, FWHMd, IRd and IRrep) used to represent each fragment ion as a vector. 3) Multivariate outlier detection techniques are used to rank all the fragment ions from each peptide. 4) Several figures are generated (a pdf file) to visualize the effect of the Top-N fragment ions over different indicators. 5) The user can choose the number of top fragment ions per peptide, thereby utilizing the optimal subset of high priority Top-N NOFIs for quantification while excluding the impaired fragment ions.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    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
    Downloads: 15 This Week
    Last Update:
    See Project
  • Full-stack observability with actually useful AI | Grafana Cloud Icon
    Full-stack observability with actually useful AI | Grafana Cloud

    Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

    Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
    Create free account
  • 5
    Navigation Shortest Map Dhaval Kadia

    Navigation Shortest Map Dhaval Kadia

    Shortest Path Navigator with Directions and Distance

    Programmed on Language C. A nano-Infant of GOOGLE-MAP Optimized to Consume some MB instead of 50 GB of RAM This was Programmed Quarter Year ago in 2014
    Downloads: 0 This Week
    Last Update:
    See Project
  • 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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    MOEA Framework

    MOEA Framework

    A Free and Open Source Java Framework for Multiobjective Optimization

    The MOEA Framework is a free and open source Java library for developing and experimenting with multiobjective evolutionary algorithms (MOEAs) and other general-purpose multiobjective optimization algorithms. The MOEA Framework supports genetic algorithms, differential evolution, particle swarm optimization, genetic programming, grammatical evolution, and more. A number of algorithms are provided out-of-the-box, including NSGA-II, NSGA-III, ε-MOEA, GDE3 and MOEA/D. In addition, the MOEA...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    PRIMUS

    PRIMUS

    Pedigree Reconstruction and Identification of a Maximum Unrelated Set

    NEW: Download new version with Pedigree Reconstruction at primus.gs.washington.edu This versions is outdated and incomplete. Please visit the new website for the complete version of PRIMUS. We present a method adapted from graph theory that always identifies the maximum set of unrelated individuals in any dataset, and allows weighting parameters to be utilized in unrelated sample selection. PRIMUS reads in user-generated IBD estimates and outputs the maximum possible set of unrelated...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9
    Cyberphantom Alfa Colony
    This is an experimental project whose main objective is the creation of artificial intelligence (AI) new tipe. At the core of this idea is the use of special genetic algorithm that emulates the single-celled organism. The colony of such cybernetic organisms can give rise to a "reasonable" network that have a huge intellect and computing power.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Try Google Cloud Risk-Free With $300 in Credit Icon
    Try Google Cloud Risk-Free With $300 in Credit

    No hidden charges. No surprise bills. Cancel anytime.

    Use your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
    Start Free
  • 10
    RANGE: produce random genetic transcription networks in the NEMO language, which when compiled outputs models in Systems Biology Markup Language. Generate synthetic microarray data, or use NEMO alone to SBML-ize a network, or visualize it in cytoscape.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    Glycosylation Microviewer

    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. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12

    gametes

    Generate complex SNP models and heterogeneous datasets

    Genetic Architecture Model Emulator for Testing and Evaluating Software (GAMETES) is an algorithm for the generation of complex single nucleotide polymorphism (SNP) models for simulated association studies. GAMETES is designed to generate epistatic models which we refer to as pure and strict, that constitute the worst-case in terms of detecting disease associations, since such associations may only be observed if all n-loci are included in the disease model. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13

    CUDAlign

    CUDAlign is a tool that aligns huge DNA sequences in CUDA capable GPUs

    CUDAlign is a tool able to align pairwise DNA sequences of unrestricted size in CUDA GPUs, using the Smith-Waterman algorithm combined with Myers-Miller. It produces the optimal alignment of 1 million base sequences in 45 seconds using a GTX 560 Ti. Many optimizations are being developed for this software. Look at the following papers for detailed information: [1] Edans Sandes, Alba Melo. Retrieving Smith-Waterman Alignments with Optimizations for Megabase Biological Sequences using GPU. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14
    EurekaOptima is a framework for optimization containing the implementation of several algorithms like Genetic Algorithm (GA), Clonal Selection Algorithm (CLONALG), Grammatical Evolution (GE), Differential Evolution (DE), and Evolution Strategy (ES).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    ESTReMo

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16
    SimpleMap

    SimpleMap

    A tool to streamline high density genetic linkage group constrcution

    Downloads: 0 This Week
    Last Update:
    See Project
  • 17
    MandALot

    MandALot

    A powerful Mandelbrot generator

    MandALot is a powerful software. It allows you to explore the Mandelbrot set, and overall to create pictures from the set. The interface is fully customizable and is divided into several parts: you can manage separately how the algorithm works, and how the colors of the interior and exterior of the set are generated. It also features multi-layer gestion. MandALot is optimized for both large and small screens.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    ArabicDiacritizer

    ArabicDiacritizer

    An automatic restoration of Arabic diacritic marks

    This is a software of Arabic diacritical marks restoration. It is based mainly on deep architectures using deep neural network. The algorithm generates diacritized text with determined end case. The algorithm is described in detail in: Ilyes Rebai, and Yassine BenAyed 'Text-to-speech synthesis system with Arabic diacritic recognition system', Computer Speech & Language, 2015.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19

    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.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 20

    ThermV

    Comprehensive thermal analysis software package

    ThermV thermal analysis software package aims to provide the most sophisticated automatic analysis of thermal analysis data (TG/DTG, DTA and DSC). It offers new algorithm for concurrent peak deconvolution at different heating rates and provides full kinetic analysis of these data, including isoconversional methods for Ea, determination of reaction model and full kinetic triplet, Avrami coefficients, and dimensionality of crystal growth for reactions in the solid state. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21

    RSSA

    Rejection-based stochastic simulation algorithm (RSSA)

    Rejection-based stochastic simulation algorithm (RSSA) is an efficient exact algorithm for doing stochastic simulation of biochemical reaction systems. RSSA improves over state of the art of stochastic simulations by avoiding and collapsing as much the number of propensity updates.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22

    TIDES

    Taylor series Integrator for Differential Equations

    Taylor series Integrator for Differential EquationS. This software is developed by Profs. A. Abad, R. Barrio, F. Blesa and M. Rodriguez, (GME, University of Zaragoza, Spain). It consists on a C (Fortran) library, libTIDES, and a Mathematica package, MathTIDES. (MathTIDES requires Mathematica version >= 7.0) . Basic references: * A. Abad, R. Barrio, F. Blesa, M. Rodriguez, 2012. Algorithm 924: TIDES, a Taylor series Integrator for Differential EquationS, ACM TOMS. 39, no. 1, art. 5. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 23
    GenoCAD
    GenoCAD is a CAD software for synthetic biology. This application provides a web-based tool to design plasmids, artificial gene networks, and other synthetic genetic systems composed of standard genetic parts. It includes a parts management system, a rule-based design tool, and a simulation engine. This project has morphed into a SaaS model. The open source code is no longer maintained.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 24

    SimpleFB_GA

    a simple genetic algorithm written in FreeBasic

    a FreeBasic-written Genetic Algorithm code is here deployed
    Downloads: 0 This Week
    Last Update:
    See Project
  • 25
    MRA

    MRA

    A general recommender system with basic models and MRA

    Multi-categorization Recommendation Adjusting (MRA) is to optimize the results of recommendation based on traditional(basic) recommendation models, through introducing objective category information and taking use of the feature that users always get the habits of preferring certain categories. Besides this, there are two advantages of this improved model: 1) it can be easily applied to any kind of existing recommendation models. And 2) a controller is set in this improved model to provide...
    Downloads: 0 This Week
    Last Update:
    See Project
MongoDB Logo MongoDB