The Reversal Median Problem, Common Intervals, and Mitochondrial Gene Orders

Abstract

AbstractAn important problem for phylogenetic investigations that are based on gene orders is to find for three given gene orders a fourth gene order that has a minimum sum of reversal distances to the three given gene orders. This problem is called Reversal Median problem (RMP). The RMP is studied here under the constraint that common (combinatorial) structures are preserved which are modeled as common intervals. An existing branch-and-bound algorithm for RMP is extended here so that it can solve the RMP with common intervals optimally. This algorithm is applied to mitochondrial gene order data for different animal taxa. It is shown that common intervals occur often for most taxa and that many common intervals are destroyed when the RMP is solved optimally with standard methods that do not consider common intervals.KeywordsGene OrderTest InstanceDynamic ConstraintAnimal TaxonCommon IntervalThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.