On the similarity of sets of permutations and its applications to genome comparison.
The comparison of genomes with the same gene content relies on our ability to compare permutations, either by measuring how much they differ, or by measuring how much they are alike. With the notable exception of the breakpoint distance, which is based on the concept of conserved adjacencies, measures of distance do not generalize easily to sets of more than two permutations. In this paper, we present a basic unifying notion, conserved intervals, as a powerful generalization of adjacencies, and as a key feature of genome rearrangement theories. We also show that sets of conserved intervals have elegant nesting and chaining properties that allow the development of compact graphic representations, and linear time algorithms to manipulate them.
Bergeron
Anne
A
CGL, Université du Québec à Montréal, Montreal, Canada.
Stoye
Jens
J
D000465:Algorithms; D000818:Animals; D019295:Computational Biology / Q000379:methods*; D023061:Gene Order / Q000235:genetics; D015321:Gene Rearrangement / Q000235:genetics; D016678:Genome / Q000235:genetics*; D008928:Mitochondria / Q000378:metabolism