Open Problems

$\bullet$

Is there a faster algorithm for sorting signed permutations using reversals ?

$\bullet$

Given 3 signed permutations , find an efficient algorithm that minimizes (finding an exact solution is NP-hard [7]).

$\bullet$

Find the reversal distance between two signed digit sequences with equal number of occurrences of each digit.

$\bullet$

Find how many sequences of reversals realize d.

$\bullet$

Find among the minimum sequences one that has some additional properties.