Genome Halving by Block Interchange
Data Structures and Algorithms
2011-07-07 v1
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.
Cite
@article{arxiv.1107.1076,
title = {Genome Halving by Block Interchange},
author = {Antoine Thomas and Aïda Ouangraoua and Jean-Stéphane Varré},
journal= {arXiv preprint arXiv:1107.1076},
year = {2011}
}