Partial enumeration of solutions traces for the problem of sorting by signed reversals
Traditional algorithms to solve the problem of sorting by signed reversals output just one optional solution while the space of optimal solutions can be huge. Algorithms for enumerating the complete set of solutions traces were developed aiming to support biologists studies of alternative evolutionary scenarios. Due to the exponential complexity of the algorithms, their practical use is limited to small permutations. In this work, we propose and evaluate three different approaches to producing a partial enumeration of the complete set of traces to transform a given permutation to another one.