On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals

Abstract

We give a theoretical answer to a natural question arising from a few years of computational experiments on the problem of sorting a permutation by the minimum number of reversals, which has relevant applications in computational molecular biology. The experiments carried out on the problem showed that the so-called alternating-cycle lower bound is equal to… (More)
DOI: 10.1023/A:1009838309166

Topics

  • Presentations referencing similar topics