Oct 252011
 

PSbR

:: DESCRIPTION

PSbR (Perfect sorting by reversals) is an implementation of an algorithm for sorting signed permutations which gives an optimal solution that respects common intervals if one such solution exists.

::DEVELOPER

Yoan Diekmann

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux/Windows/MacOsx
  • Java

:: DOWNLOAD

 PSbR

:: MORE INFORMATION

Citation

Yoan Diekmann, Marie-France Sagot, and Eric Tannier
Evolution under reversals: parsimony and conservation of common intervals“,
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4(2):301-309, 2007.

322 views

Sorry, the comment form is closed at this time.