title: Solving the preserving reversal median problem.
abstract: Genomic rearrangement operations can be very useful to infer the phylogenetic relationship of gene orders representing species. We study the problem of finding potential ancestral gene orders for the gene orders of given taxa, such that the corresponding rearrangement scenario has a minimal number of reversals, and where each of the reversals has to preserve the common intervals of the given input gene orders. Common intervals identify sets of genes that occur consecutively in all input gene orders. The problem of finding such an ancestral gene order is called the preserving reversal median problem (pRMP). A tree-based data structure for the representation of the common intervals of all input gene orders is used in our exact algorithm TCIP for solving the pRMP. It is known that the minimum number of reversals to transform one gene order into another can be computed in polynomial time, whereas the corresponding problem with the restriction that common intervals should not be destroyed is already NP-hard. It is shown theoretically that TCIP can solve a large class of pRMP instances in polynomial time. Empirically we show the good performance of TCIP on biological and artificial data.
authors.affiliation: Department of Computer Science, Parallel Computing and Complex Systems Group, University of Leipzig, Germany. bernt@informatik.uni-leipzig.de
authors.forename: Matthias
authors.initials: M
authors.lastname: Bernt
authors.forename: Daniel
authors.initials: D
authors.lastname: Merkle
authors.forename: Martin
authors.initials: M
authors.lastname: Middendorf
mesh_terms: D000465:Algorithms; D002874:Chromosome Mapping / Q000379:methods*; D003198:Computer Simulation; D004252:DNA Mutational Analysis / Q000379:methods*; D019143:Evolution, Molecular; D042822:Genomic Instability / Q000235:genetics*; D008957:Models, Genetic; D017422:Sequence Analysis, DNA / Q000379:methods*