2011/07/06 by Antoine Thomas, Thomas, Antoine, Aïda Ouangraoua +4
Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #DNA and Biological Computing #Genome Rearrangement Algorithms #cs.DS
paper · pdf · doi:10.48550/arxiv.1107.1076
arxiv created 2011/07/06 · arxiv updated 2011/07/07
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.