On Weighting Schemes for Gene Order Analysis

Gene order analysis aims at extracting phylogenetic information from the comparison of the order and orientation of the genes on the genomes of different species. This can be achieved by computing parsimonious rearrangement scenarios, i.e. to determine a sequence of rearrangements events that transforms one given gene order into another such that the sum of weights of the included rearrangement events is minimal. In this sequence only certain types of rearrangements, given by the rearrangement model, are admissible and weights are assigned with respect to the rearrangement type. The choice of a suitable rearrangement model and corresponding weights for the included rearrangement types is important for the meaningful reconstruction. So far the analysis of weighting schemes for gene order analysis has not been considered sufficiently. In this paper weighting schemes for gene order analysis are considered for two rearrangement models: 1) inversions, transpositions, and inverse transpositions; 2) inversions, block interchanges, and inverse transpositions. For both rearrangement models we determined properties of the weighting functions that exclude certain types of rearrangements from parsimonious rearrangement scenarios.

[1]  Matthias Bernt,et al.  CREx: inferring genomic rearrangements based on common intervals , 2007, Bioinform..

[2]  Chuan Yi Tang,et al.  SPRING: a tool for the analysis of genome rearrangement using reversals and block-interchanges , 2006, Nucleic Acids Res..

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

[4]  D. Sankoff,et al.  Parametric genome rearrangement. , 1996, Gene.

[5]  David A. Christie,et al.  Sorting Permutations by Block-Interchanges , 1996, Inf. Process. Lett..

[6]  Guillaume Fertin,et al.  Sorting by Transpositions Is Difficult , 2010, SIAM J. Discret. Math..

[7]  W. Ewens,et al.  The chromosome inversion problem , 1982 .

[8]  Matthias Bernt,et al.  A method for computing an inventory of metazoan mitochondrial gene order rearrangements , 2011, BMC Bioinformatics.

[9]  Guohui Lin,et al.  Signed genome rearrangement by reversals and transpositions: models and approximations , 2001, Theor. Comput. Sci..

[10]  Z. Dias,et al.  Genome rearrangements distance by fusion, fission, and transposition is easy , 2001, Proceedings Eighth Symposium on String Processing and Information Retrieval.

[11]  Niklas Eriksen,et al.  (1+epsilon)-Approximation of sorting by reversals and transpositions , 2001, Theor. Comput. Sci..

[12]  Chun-Yuan Lin,et al.  Sorting by reversals and block-interchanges with various weight assignments , 2009, BMC Bioinformatics.

[13]  Niklas Eriksen (1+epsilon)-Approximation of Sorting by Reversals and Transpositions , 2001, WABI.

[14]  David Sankoff,et al.  Edit Distance for Genome Comparison Based on Non-local Operations * 1 Role of Rearrangements in Evolution , .

[15]  Martin Bader,et al.  Sorting by reversals, block interchanges, tandem duplications, and deletions , 2009, BMC Bioinformatics.

[16]  Enno Ohlebusch,et al.  Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions , 2006, RECOMB.

[17]  João Meidanis,et al.  Sorting by Block-Interchanges and Signed Reversals , 2007, Fourth International Conference on Information Technology (ITNG'07).

[18]  Guillaume Fertin,et al.  Combinatorics of Genome Rearrangements , 2009, Computational molecular biology.

[19]  Roded Sharan,et al.  A 1.5-approximation algorithm for sorting by transpositions and transreversals , 2004, J. Comput. Syst. Sci..

[20]  Enno Ohlebusch,et al.  A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions , 2008, BMC Bioinformatics.

[21]  Steven Skiena,et al.  Improved bounds on sorting with length-weighted reversals , 2004, SODA '04.

[22]  Richard Friedberg,et al.  Efficient sorting of genomic permutations by translocation, inversion and block interchange , 2005, Bioinform..

[23]  David Sankoff,et al.  Common Intervals and Symmetric Difference in a Model-Free Phylogenomics, with an Application to Streptophyte Evolution , 2006, Comparative Genomics.

[24]  N. Eriksen Combinatorics of genome rearrangements and phylogeny , 2001 .