Next: Bibliography
Up: An Algorithm for Sorting
Previous: Algorithm Summary
Open Problems
![$\bullet$](img132.gif)
-
Is there a faster algorithm for sorting signed permutations using
reversals ?
![$\bullet$](img132.gif)
-
Given 3 signed permutations
,
find an efficient
algorithm that minimizes
(finding an exact
solution is NP-hard [7]).
![$\bullet$](img132.gif)
-
Find the reversal distance between two signed digit sequences with equal
number of occurrences of each digit.
![$\bullet$](img132.gif)
-
Find how many sequences of reversals realize d.
![$\bullet$](img132.gif)
-
Find among the minimum sequences one that has some additional
properties.
Itshack Pe`er
1999-03-16