Efficient Bounds for Oriented Chromosome Inversion Distance

@inproceedings{Kececioglu1994EfficientBF,
  title={Efficient Bounds for Oriented Chromosome Inversion Distance},
  author={John D. Kececioglu and David Sankoff},
  booktitle={CPM},
  year={1994}
}
We study the problem of comparing two circular chromosomes that have evolved by chromosome inversion, assuming that the order of corresponding genes is known, as well as their orientation. Determining the minimum number of inversions is equivalent to finding the minimum of reversals to sort a signed circular permutation, where a reversal takes an arbitrary substring of elements and reverses their order, as well as flipping their sign. We show that tight bounds on the minimum number of reversals… CONTINUE READING