Genome Halving by Block Interchange

TL;DR

This paper presents a polynomial-time algorithm and a formula for determining the minimal number of block interchanges needed to convert a duplicated linear genome into a tandem duplicated genome, advancing genome rearrangement analysis.

Contribution

It introduces a new polynomial-time algorithm and a formula for genome halving by block interchange, a novel approach in genome rearrangement problems.

Findings

Provided a formula for the minimal block interchanges

Developed a polynomial-time sorting algorithm

Enhanced understanding of genome halving processes

Abstract

We address the problem of finding the minimal number of block interchanges (exchange of two intervals) required to transform a duplicated linear genome into a tandem duplicated linear genome. We provide a formula for the distance as well as a polynomial time algorithm for the sorting problem.