Evolution under reversals: parsimony and conservation of common intervals.
In comparative genomics, gene order data is often modeled as signed permutations. A classical problem for genome comparison is to detect common intervals in permutations, that is, genes that are colocalized in several species, indicating that they remained grouped during evolution. A second largely studied problem related to gene order is to compute a minimum scenario of reversals that transforms a signed permutation into another. Several studies began to mix the two problems and it was observed that their results are not always compatible: Often, parsimonious scenarios of reversals break common intervals. If a scenario does not break any common interval, it is called perfect. In two recent studies, Bérard et al. defined a class of permutations for which building a perfect scenario of reversals sorting a permutation was achieved in polynomial time and stated as an open question whether it is possible to decide, given a permutation, if there exists a minimum scenario of reversals that is perfect. In this paper, we give a solution to this problem and prove that this widens the class of permutations addressed by the aforementioned studies. We implemented and tested this algorithm on gene order data of chromosomes from several mammal species and we compared it to other methods. The algorithm helps to choose among several possible scenarios of reversals and indicates that the minimum scenario of reversals is not always the most plausible.
Diekmann
Yoan
Y
Technische Faltutät, Universität Bielefeld, Bielefeld, Germany. Yoan.Diekmann@uni-bielefeld.de
Sagot
Marie-France
MF
Tannier
Eric
E
D000465:Algorithms; D001483:Base Sequence; D002874:Chromosome Mapping / Q000379:methods*; D017124:Conserved Sequence / Q000235:genetics*; D019143:Evolution, Molecular; D015321:Gene Rearrangement / Q000235:genetics*; D014644:Genetic Variation / Q000235:genetics; D008969:Molecular Sequence Data; D017422:Sequence Analysis, DNA / Q000379:methods*