Search Results for "genetic algorithm c" - Page 10
Sort By:
Showing 1013 open source projects for "genetic algorithm c"
View related business solutions-
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.
-
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.
-
1
GAKNN is a data mining software for gene annotation data. GAKNN is built with k- Nearest Neighbour algorithm optimized by the genetic algorithm. Gene annotation datasets saved under .csv or .arff formats with Gene Ontology or FunCat categorization can use GAKNN to predict gene functions.
-
2
GA-tools
general genetic algorithms optimization fortran 95 routines
High level optimization routines in Fortran 95 for optimization problems using a genetic algorithm with elitism, steady-state-reproduction, dynamic operator scoring by merit, no-duplicates-in-population. Chromosome representation may be integer-array, real-array, permutation-array, character-array. Single objective and multi-objective maximization routines are present. Possible to incorporate own crossover and mutation operators exclusively or in addition to standard operators that are included by default. ... -
3
IPAS for protein sequences
multiple alignment algorithm for protein sequences
IPAS is a new and practial protein multiple sequence alignment algorithm based on iterative progresive alignment algorithm Assessed on BAliBASE 3.0, PREFAB 4.0, SABMARK 1.65, and OXBENCH, MSAProbs achieves the statistically highest alignment accuracy, compared to ClustalW 2.0.10, MAFFT 6.717( using L-INS-i with --maxiterate = 1000), MUSCLE 3.8.31, ProbCons 1.12, and Probalign 1.3. -
4
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. -
Full-stack observability with actually useful AI | Grafana CloudBuilt 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.
-
5
MCU Media Server
SIP Video Multiconference Media Server with WebRTC support.
REPOSITORY MOVED TO GITHUB!! https://github.com/medooze/media-server Video Multiconference Media Server with WebRTC support. Provide Multiconference and video broadcasting services to any SIP service. Supports VP8, H264, MP4V-ES, H263 and H263P, continuous presence, RTMP flash broadcasting, adhoc conferences, load balancing and administrative WEB interface. JSR309 driver implementation under development. . -
6
SUPERmerge
ChIP-seq coverage island analysis algorithm for broad histone marks
SUPERmerge is a ChIP-seq read pileup analysis and annotation algorithm for investigating alignment (BAM) files of diffuse histone modification ChIP-seq datasets with broad chromatin domains at a single base pair resolution level. SUPERmerge allows flexible regulation of a variety of read pileup parameters, thereby revealing how read islands aggregate into areas of coverage across the genome and what annotation features they map to within individual biological replicates. SUPERmerge is... -
7
Random Bits Forest
RBF: a Strong Classifier/Regressor for Big Data
We present a classification and regression algorithm called Random Bits Forest (RBF). RBF integrates neural network (for depth), boosting (for wideness) and random forest (for accuracy). It first generates and selects ~10,000 small three-layer threshold random neural networks as basis by gradient boosting scheme. These binary basis are then feed into a modified random forest algorithm to obtain predictions. In conclusion, RBF is a novel framework that performs strongly especially on data... -
8
MSU's Sparse Fourier Repository
The Home of DMSFT, AAFFT, GFFT, and MSFFT.
A collection of sparse Fourier transform codes developed by faculty at MSU. Currently codes for four different prototype sparse FFTs are here: 1.) DMSFT, implemented by Ruochuan Zhang. This is a fast, stable, noise robust, and *fully discrete* improvement on the ideas in GFFT below. It is THE BEST sparse FFT around!!! If you're looking for AAFFT, try this out first. 2.) AAFFT, implemented by Mark Iwen in 2008. This code is easy to use, and documented well, but not implemented... -
9
passgen
Passgen - easy to use, simple password generator
Passgen is easy to use, simple based on hexal and octal digits system password generator. -
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
10
Satsuma .NET Graph Library
a delicious .NET graph library
Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal... -
11
RAtom
solves nonlinear Kohn-Sham equation for the neutral atom.
...The program is implemented in C++, it runs as a single thread. The implemented algorithm is described in the following papers: 1. Z. Romanowski, "Adaptive solver of a Kohn-Sham equation for an atom", Modelling Simul. Mater. Sci. Eng. vol. 17, 045001 (2009) 2. Z. Romanowski, "Application of h-adaptive, high order finite element method to solve radial Schrödinger equation", Molecular Physics, vol. 107, pp. 1339-1348 (2009). -
12
RSchr-5
Solves one-electron Schrödinger equation, with SLEPc and PETSc
RSchr-5 calculates the smallest eigenvalues of the one-electron Schrödinger equation. The solved problem is defined on the finite domain, which is a box. The problem is solved with the zero Dirichlet boundary conditions. The implemented algorithm uses Finite Element Method with B-splines as basis functions. Disctretization leads to generalized eigenvalue problem. Program RSchr-5 solves the generalized eigenvalue problem by algorithms implemented in SLEPc amd PETSc libraries. It uses Krylov-Schur algorithm from SLEPc library. The program is implemented in C++. The implementation is based on Message Passing Interface (MPI). -
13
Integrated Merging of Orthogonal [Genetic] Datasets to identify novel genes involved in processes starting with known genes. For UNIX-like systems (C code + TCSH scripts), command-line based.
-
14
nunn
This is an implementation of a machine learning library in C++17
nunn is a collection of ML algorithms and related examples written in modern C++17. -
15
text replace case insensitive c# vb.net
.NET replace text case insensitive
Fast algorithm text (string) replace case insensitive writing in .NET. Increase the performance of your application! -
16
The min cost is a program which is going to find the minimum cost or path of any given numbers. if you have a certain set of numbers this program is going to calculate the optimized cost for that set. Similarly, the program can perform Dijkstra's algorithm which is an algorithm for finding the shortest paths between nodes in a graph by simply insert the node distance in the input file and output the shortest path in output file. The program was written in C++ using a main algorithm of a heap sorting. In this program, specifically users the codes for minimum heap since the purpose of the program is to find the minimum cost or path.
-
17
NiceShaper - Dynamic Traffic Shaper
NiceShaper provides dynamic traffic shaping for Linux router
NiceShaper is the program developed for Linux router environment. It works in user space on top of standard Linux QOS implementation and iptables. By default, a proven HTB algorithm is used for the root, inner, and leaf classes, SFQ packets scheduling algorithm is the default queuing discipline (qdisc) contained within each of leaf classes, U32 and FW are used as the packets classifiers. NiceShaper provides dynamic traffic shaping approach which is more effective than traditional shaping... -
18
Parallel MILC
Parallel decompression for the MILC algorithm
The MILC compression has been developed specifically for medical images and proven to be effective. This algorithm is a parallel version for the decompression phase, meant to exploit the parallel computing potential of the modern hardware. Developed with OpenCL framework (version 1.2), runs on CPU and GPU OpenCL devices. -
19
MicroGP
A multi-purpose extensible self-adaptive evolutionary algorithm
MicroGP (µGP, ugp) is a versatile optimizer able to outperform both human experts and conventional heuristics in finding the optimal solution of hard problems. It is an evolutionary algorithm since it mimics some principles of the Neo-Darwinian paradigm. ⚠️ A new version is available on https://github.com/squillero/microgp4 -
20
cupSODA
Deterministic simulator of mass-action based models
cupSODA is a simulator of biological systems that exploits the remarkable memory bandwidth and computational capability of GPUs. cupSODA allows to efficiently execute in parallel large numbers of simulations, which are usually required to investigate the emergent dynamics of a given biological system under different conditions. cupSODA works by automatically deriving the system of ordinary differential equations from a reaction-based mechanistic model, defined according to the mass-action... -
21
MultiFast
Mass String Search and Replace Solution via Aho-Corasick Algorithm
Multifast provides you with efficient library and tool, to search and manipulate data streams on the fly. It can search for a huge number of strings and replace them in one pass. It contains a tidy and efficient implementation of the Aho-Corasick algorithm as a C library. -
22
This package implements the algorithm bagging markov random field method with c++ together with Java interface. http://nar.oxfordjournals.org/content/41/2/e42.long Cytoscape App: BMRF-Net-CytoscapeV1.0.tar.gz https://sourceforge.net/projects/bmrfcjava/files/BMRF-Net%20Package/BMRF-Net-CytoscapeV1.0.tar.gz/download Source code and standalone version: BMRF-Net-standalone.tar.gz https://sourceforge.net/projects/bmrfcjava/files/BMRF-Net%20Package/BMRF-Net-standaloneV1.1.tar.gz/download BMRF-Net-standalone V1.1: fix issues in analyzing large scale network
-
23
-
24
tsp-problem-ga-aco-comparisson
Genetic Algorithm and Ant Colony to solve the TSP problem
This project compares the classical implementation of Genetic Algorithm and Ant Colony Optimization, to solve a TSP problem. It's possible to define the number of cities to visit , and also interactively create new cities to visit in a 2D spatial panel. A total distance is given for AG and ACO solution at end. -
25
Community Detection Modularity Suite
Suite of community detection algorithms based on Modularity
...Newman, Physical Review E, 74(3):036104, 2006. [3] B. Ball et al, An efficient and principled method for detecting communities in networks, 2011. The suite is based upon the fast community algorithm implemented by Aaron Clauset <aaron@cs.unm.edu>, Chris Moore, Mark Newman, and the R IGraph library Copyright (C) 2007 Gabor Csardi <csardi@rmki.kfki.hu>. It also makes of the classes available from Numerical Recipies 3rd Edition W. Press, S. Teukolsky, W. Vetterling, B. Flanne
