Listing Sorting Sequences of Reversals and Translocations

Algorithms for sorting by reversals and translocations (SBRT) are often used to propose evolutionary scenarios of multichromosomal genomes. The existing algorithms for the SBRT problem provide a single sorting sequence of reversals and translocations. In this paper we propose multiple solutions for the problem and present a methodology to list all possible sorting sequences of reversals and translocations for a given pair of genomes without knots. Listing all the sorting sequences is useful in assessing the biological merits of various parsimonious rearrangement scenarios.