Search Results for "genetic algorithm software"
Sort By:
Showing 76 open source projects for "genetic algorithm software"
View related business solutions-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
Earn up to 16% annual interest with Nexo.Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
1
Gemi
PCR primers / probes design from multiple & degenerate sequences
Please, do not hesitate to contact us if you need help. https://sites.google.com/view/hsa23/ Gemi, an automated, fast, and easy-to-use bioinformatics tool with a user-friendly interface to design primers and probes for polymerase chain reaction (PCR). Gemi accepts multiple aligned and long DNA and RNA sequences with degenerate nucleotide (non-A/C/G/T bases). Gemi can be used for quantitative, real-time and conventional PCR (qPCR, rt-PCR, etc.), and Sanger sequencing. Gemi can parse large... -
2
Nemo
Individual-based forward-time genetics simulation software
Nemo is an individual-based, forward-time, genetically explicit, and stochastic simulation software designed for the study of the evolution of life history and quantitative traits, and genetic markers under various types of selection, in a spatially explicit, metapopulation framework. -
3
BIGSdb
Software for storing and analysing bacterial sequence data
The Bacterial Isolate Genome Sequence Database (BIGSdb) is a scalable, web-accessible database system designed to store and analyse linked phenotypic and genotypic information in a computationally efficient manner. Sequence data can range from single sequence reads to multiple contigs generated by whole genome sequencing technologies. The system incorporates the capacity to define and identify any number of loci and genetic variants at those loci within the stored nucleotide sequences. ... -
4
bioweb
polyglot language framework to analyze genetic data
polyglot framework using Python/C++/JavaScript to fast develop applications to analyze biological sequences -
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
5
MaxBin
An automatic tool for binning metagenomics sequences
MaxBin is a software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm. Users could understand the underlying bins (genomes) of the microbes in their metagenomes by simply providing assembled metagenomic sequences and the reads coverage information or sequencing reads. For users' convenience MaxBin will report genome-related statistics, including estimated completeness, GC content and genome size in the binning summary page. -
6
CUDASW++: Smith-Waterman Algorithm
The fastest Smith-Waterman protein database search algorithm on GPUs
CUDASW++ software is a public open source software for Smith-Waterman protein database searches on Graphics Processing Units with CUDA. This software have been added to the NVIDIA Tesla Bio Workbench (http://www.nvidia.com/object/swplusplus_on_tesla.html -
7
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. ...
-
8
JSiteDescriptor
Binding site descriptor generation for SVM based classification.
A set of java programs that extract coordinate and chemical information from PDB files. The binding site regions are extracted using grid based scheme. For binding site, spatio-chemical descriptor is generated based on PocketMatch algorithm of Dr. Kalidas (author of this project too). -
9
D-Tailor
D-Tailor: automated analysis and design of DNA sequences
...However, our ability to design sequences to interrogate multifactorial biological processes and further engineer biological functions is lagging behind. DNA-Tailor (D-Tailor) is a fully extendable software framework for biological sequence analysis and multi-objective sequence design. D-Tailor permits the seamless integration of an arbitrary number of sequence analysis tools into a Monte-Carlo algorithm that evolves synthetic sequences towards user-defined goals. -
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
10
CABBaGe
Classification Algorithm Based on a Bayesian method for Genomics
-
11
This site hosts the source code for C++ version of the Broker for SBW, NOM module, advanced simulation suite, analysis applications and model editors.
-
12
pySBOL
SWIG-Python wrappers for libSBOL
pySBOL is a SWIG-Python wrapper around libSBOL, a module for reading, writing, and constructing genetic designs according to the standardized specifications of the Synthetic Biology Open Language (SBOL). This page provides binary installers for Windows operating system for Python 2.7 and 3.6. For installation instructions, visit: https://pysbol2.readthedocs.io/en/latest/installation.html For full documentation, visit: https://pysbol2.readthedocs.io/en/latest/index.html -
13
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. -
14
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. -
15
QSdpR
Viral Quasispecies Reconstruction software based on QSdpR algorithm
This is a viral quasispecies reconstruction software for quasispecies assembly problem on mRNA viruses, which is based on a correlation clustering approach and uses semidefinite optimization framework. The software accepts a reference genome, a NGS read set aligned to this reference and set of SNP locations in the form of a vcf file and outputs an optimal set of reconstructed species genomes which describes the underlying viral population. -
16
Visualization of Protein-Ligand Graphs
Compute protein graphs. Moved to https://github.com/MolBIFFM/PTGLtools
NOTE: Project moved to https://github.com/MolBIFFM/PTGLtools. The Visualization of Protein-Ligand Graphs (VPLG) software package computes and visualizes protein graphs. It works on the super-secondary structure level and uses the atom coordinates from PDB files and the SSE assignments of the DSSP algorithm. VPLG is command line software. If you do not like typing commands, try our PTGL web server: http://ptgl.uni-frankfurt.de/ -
17
MSAProbs: Multiple Sequence Alignment
One of the most accurate multiple protein sequence aligners
MSAProbs is an open-source protein multiple sequence ailgnment algorithm, achieving the stastistically highest alignment accuracy on popular benchmarks: BALIBASE, PREFAB, SABMARK, OXBENCH, compared to ClustalW, MAFFT, MUSCLE, ProbCons and Probalign. -
18
DNA patterns & application
A software for generating DNA patterns
The DNA pattern represents a new method of analysis for DNA sequences. In general it can easily detect relationships among species over the evolutionary landscape. Largely, in bioinformatics the DNA pattern method is unexplored and many discoveries can be made through it. One of the questions to which an answer was given is: How many types of promoters are out there regulating the genes ? It seems that there are 10 types of promoters. The project also contains 20,000 images (DNA... -
19
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. -
20
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.
-
21
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 -
22
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. -
23
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
-
24
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. -
25
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...
