The Problem of Chromosome Reincorporation in DCJ Sorting and Halving

We study two problems in the double cut and join (DCJ) model: sorting - transforming one multilinear genome into another and halving - transforming a duplicated genome into a perfectly duplicated one. The DCJ model includes rearrangement operations such as reversals, translocations, fusions and fissions. We can also mimic transpositions or block interchanges by two operations: we extract an appropriate segment of a chromosome, creating a temporary circular chromosome, and in the next step we reinsert it in its proper place. Existing linear-time algorithms solving both problems ignore the constraint of reincorporating the temporary circular chromosomes immediately after their creation. For the restricted sorting problem only a quadratic algorithm was known, whereas the restricted halving problem was stated as open by Tannier, Zheng, and Sankoff. In this paper we address this constraint and show how to solve the problem of sorting in O(n log n) time and halving in O(n3/2) time.

[1]  Haim Kaplan,et al.  Sorting signed permutations by reversals, revisited , 2005, J. Comput. Syst. Sci..

[2]  Rita Casadio,et al.  Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, WABI.

[3]  Anne Bergeron,et al.  Advances on sorting by reversals , 2007, Discret. Appl. Math..

[4]  Annie Chateau,et al.  Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes , 2009, J. Comput. Biol..

[5]  Yijie Han.  Improving the Efficiency of Sorting by Reversals , 2006, BIOCOMP.

[6]  Yu Lin,et al.  Sorting signed permutations by inversions in O(nlogn) time. , 2010, Journal of computational biology : a journal of computational molecular cell biology.

[7]  Daming Zhu,et al.  Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges , 2006, TAMC.

[8]  Marek Chrobak,et al.  A Data Structure Useful for Finding Hamiltonian Cycles , 1990, Theor. Comput. Sci..

[9]  Ron Shamir,et al.  An O(n3/2sqrt(log(n))) algorithm for sorting by reciprocal translocations , 2011, J. Discrete Algorithms.

[10]  Julia Mixtacki,et al.  Genome Halving under DCJ Revisited , 2008, COCOON.

[11]  David Sankoff,et al.  Multichromosomal median and halving problems under different genomic distances , 2009, BMC Bioinformatics.

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

[13]  David Sankoff,et al.  The Reconstruction of Doubled Genomes , 2003, SIAM J. Comput..

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

[15]  Ron Shamir,et al.  An O(n3/2sqrt(log n)) Algorithm for Sorting by Reciprocal Translocations , 2006, CPM.

[16]  Jens Stoye,et al.  A Unifying View of Genome Rearrangements , 2006, WABI.

[17]  David Sankoff,et al.  Genome Halving with Double Cut and Join. , 2007 .