Genome Halving by Block Interchange
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...