Mgenome 1.0 – Finding the Optimal Trees for Multiple Genome Rearrangement by Signed Reversals

Mgenome 1.0

:: DESCRIPTION

Mgenome is designed to find the optimal trees for multiple genome rearrangement by signed reversals. The problem is modeled as: For a given collection of genomes represented by signed permutations on genes, find a tree to connect the given genomes by reversal paths such that the number of all signed reversals is minimized.

::DEVELOPER

Xun Gu

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Windows

:: DOWNLOAD

 Mgenome

:: MORE INFORMATION

Citation:

S. Wu and X. Gu,
Algorithms for multiple genome rearrangement by signed reversals,
Pacific Symposium on Biocomputing, 8(2003), 363-374.

Leave a Reply

Your email address will not be published. Required fields are marked *

 

This site uses Akismet to reduce spam. Learn how your comment data is processed.