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.

[1]  D. Sankoff,et al.  Gene Order Breakpoint Evidence in Animal Mitochondrial Phylogeny , 1999, Journal of Molecular Evolution.

[2]  Jens Stoye,et al.  Finding All Common Intervals of k Permutations , 2001, CPM.

[3]  Pavel A. Pevzner,et al.  Transforming men into mice (polynomial algorithm for genomic distance problem) , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[4]  Bret Larget,et al.  A Markov chain Monte Carlo approach to reconstructing ancestral genome arrangements , 2002 .

[5]  H. Ritter,et al.  An Axiomatic Theory of Fuzzy Quantifiers in Natural Languages , 2001 .

[6]  Glenn Tesler,et al.  Efficient algorithms for multichromosomal genome rearrangements , 2002, J. Comput. Syst. Sci..

[7]  Vineet Bafna,et al.  Sorting by Transpositions , 1998, SIAM J. Discret. Math..

[8]  Haim Kaplan,et al.  Faster and simpler algorithm for sorting signed permutations by reversals , 1997, SODA '97.

[9]  David A. Bader,et al.  A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study , 2001, WADS.

[10]  David Alan Christie,et al.  Genome rearrangement problems , 1998 .

[11]  Pavel A. Pevzner,et al.  Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.

[12]  David Sankoff,et al.  Short inversions and conserved gene cluster , 2002, Bioinform..

[13]  David Sankoff,et al.  Short inversions and conserved gene clusters , 2002, SAC '02.

[14]  Jens Stoye,et al.  Common intervals and sorting by reversals: a marriage of necessity , 2002, ECCB.

[15]  Nadia El-Mabrouk,et al.  Exploring the Set of All Minimal Sequences of Reversals - An Application to Test the Replication-Directed Reversal Hypothesis , 2002, WABI.

[16]  Tao Liu,et al.  Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data , 2002, WABI.

[17]  Ron Shamir,et al.  Two Notes on Genome Rearrangement , 2003, J. Bioinform. Comput. Biol..

[18]  P. Pevzner,et al.  Genome-scale evolution: reconstructing gene orders in the ancestral species. , 2002, Genome research.

[19]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[20]  Adam C. Siepel,et al.  An algorithm to enumerate all sorting reversals , 2002, RECOMB '02.

[21]  Takeaki Uno,et al.  Fast Algorithms to Enumerate All Common Intervals of Two Permutations , 1997, Algorithmica.

[22]  Adam Siepel,et al.  An algorithm to find all sorting reversals , 2002 .

[23]  David Sankoff,et al.  Efficient Bounds for Oriented Chromosome Inversion Distance , 1994, CPM.