ABSTRACT
ABSTRACT: Reversal is one of the most commonly observed evolutionary events that affects the order of genes in a single chromosome. By comparing the order of shared genes in two genomes that have evolved by reversals events, their evolutionary scenario is reconstructed. The problem of finding the most plausible sequence of reversals that changed the genomes is complicated by the fact that for most of the cases, several solutions are generated using the computational methods. Much work has been done to reduce the time and space complexities of these approaches. Another issue in the implementation is the problem of hurdles. We modify the existing approaches to enumerate the possible solutions of the sorting by reversals problem in the presence of hurdles and compare their performance.
