Genome Halving by Block Interchange
classification
💻 cs.DS
keywords
genomeblockduplicatedlinearproblemaddressalgorithmdistance
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.