Median Reversal by Local Search (MedRbyLS) is described in the paper: Computing Genomic Midpoints. In preparation [abstract]

The Problem: Midpoint genome rearrangement problem. Given there genomes G1, G2, G3 find a midpoint genome G that minimizes d(G1,G)+d(G2,G)+d(G3,G), where d is the reversal/genomic distance.

MedRbyLS is a local search algorithm that attempts to find midpoint genomes. This is the executable for Linux. MedRbyLS (the source code will beonline soon).

This is the executable for a generator of random (multichromosomal) genomes. genGenome described in the paper.

How to generate Random Genomes:
./genGenome -h will provide all the options of the code.
example: /genGenome -n100 -c 5 -r 40 -s 1 gives Gm100c5r40-1.yan
try with different seed and get Gm100c5r40-2.yan, Gm100c5r40-3.yan

How to run the Solver:
./MedRbyLS -h will write all the options
example:
./MedRbyLS --g1 Gm100c5r40-1.yan --g2 Gm100c5r40-2.yan --g3 Gm100c5r40-3.yan --point Gm100c5r40-3.yan -p 0.15 -N 1000000 --out out --mid mid -P
running this should give you the midpoint mid