Sorting by restricted-length-weighted reversals.

Abstract excerpt

Classical sorting by reversals uses the unit-cost model, that is, each reversal consumes an equal cost. This model limits the biological meaning of sorting by reversal. Bender and his colleagues extended it by assigning a cost function f(l) = l(alpha) for all alpha > or =0, where l is the length of the reversed subsequence. In this paper, we extend their results by considering a model in which long reversals are...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Chromosome Inversion
• Share to Computational Biology