Cryptography Genetic

Toolkit for processing genetic data. Currently supports (command-line): Half-IBD (Identity by descent) aka HIRs - between 2 or any number of files (in distances and cM); RAW2PED, PED2RAW conversions; regions of homozygousity and other converters.

The script finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to unique individual cities and finally to the end location).Each salesman starts at the...

Finds a (near) optimal solution to a variation of the M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to individual cities and back to the original starting place).Each salesman starts at the first point, and...


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

The algorithm computes the optimal route from a fixed predetermined starting point to all other cities without returning to the starting point. Requirements: - MATLAB 7.6 or higher


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

Libecc is an Elliptic Curve Cryptography C library for fixed size keys in order to achieve a maximum speed.The goal of this project is to become the first free Open Source library providing the means to generate safe elliptic curves.


Platforms: Windows, Mac, *nix, C/C++, BSD Solaris

Charlemagne is a genetic programming application which aims to be highly configurable and applicable to a broad range of problems.It is written in Python and Lisp and to some degree is extensible in both languages. It features built-in input-output mapping support, but also provides the ability...


Platforms: *nix, Python, BSD

ECC library is a package for Elliptic Curve cryptography.ECC is implemented by using OpenSSL 0.9.6a or higher, for message digests and symmetric ciphers, and by using the Portable Object Compiler and Computer Algebra Kit for the elliptic curve cryptography.


Platforms: C and C plus plus

BeeCrypt is an ongoing project to provide a strong and fast cryptography toolkit.It includes entropy sources, random generators, block ciphers, hash functions, message authentication codes, multiprecision integer routines, and public key primitives.


Platforms: C and C plus plus

The function implement the 1D Walash Transform which can be used in signal processing,pattern recognition and Genetic algorithms. The Formula of 1D Walsh Transform is defined as : N-1 q-1 ---- -- 1 | | b[i](m)*b[q-1-i](u) W(u) = --- / f(m)| | (-1) ,u = 0,...,N-1 N ---- | | m=0 i=0 where for...


Platforms: Matlab

The function implement the 1D Walash Transform which can be used in signal processing,pattern recognition and Genetic algorithms. The Formula of 1D Walsh Transform is defined in mfile


Platforms: Matlab

The function generates sequency(Walsh) ordered Hadamard matrix useful for image processing, signal processing, genetic algorithms etc.


Platforms: Matlab

This demo shows how to use MATLAB, Optimization Toolbox, and Genetic Algorithm and Direct Search Toolbox to optimize the design of a double wishbone suspension system.Note: You will need to have the following products installed in order to run this demo: MATLAB, Simulink, Optimization Toolbox,...


Platforms: Matlab

it is used for genetic algorithm implementation for scheduling in wireless sensor networks


Platforms: Matlab

This program demonstrates the optimization by genetic algorithm to find the global maximum height for thee dimensional multiple peak surface. The GA operates by real coding method with elitism


Platforms: Matlab

TurboGA is an augmented version of the Matlab script SpeedyGA (also available on File Exchange). TurboGA uses a simple mechanism called clamping, which, according to a new theory about the workings of genetic algorithms (see http://www.cs.brandeis.edu/~kekib/dissertation.html ), should...


Platforms: Matlab

This code is a demo of using Genetic Algorithms (GA) to solve a simple constrained multi-objective optimization (MOO) problem.The objective is to find the pareto front of the MOO problem defined as follows: Maximize: f1(X) = 2*x1 + 3*x2 f2(X) = 2/x1 + 1/x2 such that: 10 > x1 > 20 20 > x2 > 30The...


Platforms: Matlab

This function is a simple but flexible and usefull tool to implement genetic optimization algorithms that work with populations of custom units. This tool allows to customize the fitness function, the stopping criteria and the cross-over and mutation operators. This is a simple tool, written in...


Platforms: Matlab

This function can find the maximum of constrained and unconstrained problems with using of genetic algorithm (real coding). Also the performance of GA is plotted vs. the number of generations (for 2D problems).


Platforms: Matlab

ASNread reads in ASN-formatted genetic sequence data into a MATLAB structure.


Platforms: Matlab

Techniques from information theory are usual for the selection of variables in time series prediction or pattern recognition. These tasks involve, directly or indirectly, the maximization of the mutual information between input and output data. However, this procedure requires a high...


Platforms: Matlab