Sampling solution traces for the problem of sorting permutations by signed reversals

Sampling solution traces for the problem of sorting permutations by signed reversals

<p>Abstract</p> <p>Background</p> <p>Traditional algorithms to solve the problem of sorting by signed reversals output just one optimal solution while the space of all optimal solutions can be huge. A so-called trace represents a group of solutions which share the same...

Full description

Bibliographic Details
Main Authors: Baudet Christian, Dias Zanoni, Sagot Marie-France
Format: Article
Language:English
Published: BMC 2012-06-01
Series:Algorithms for Molecular Biology
Subjects:
Reversals
Traces
Sampling
Genome rearrangement
Online Access:http://www.almob.org/content/7/1/18

Internet

http://www.almob.org/content/7/1/18

Similar Items