Restricted DCJ-Indel Model Revisited

The Double Cut and Join (DCJ) is a generic operation representing many rearrangements that can change the organization of a genome, but not its content. For comparing two genomes with unequal contents, in addition to DCJ operations, we have to allow insertions and deletions of DNA segments. The distance in the so-called general DCJ-indel model can be exactly computed, but allows circular chromosomes to be created at intermediate steps, even if the compared genomes are linear. In this case it is more plausible to consider the restricted DCJ-indel model, in which the reincorporation of a circular chromosome has to be done immediately after its creation. This model was studied recently by daaSilva et al.a(BMCaBioinformaticsa13, Suppl.a19, S14), but only an upper bound for the restricted DCJ-indel distance was provided. Here we solve an open problem posed in that paper and present a very simple proof showing that the distance, that can be computed in linear time, is always the same for both the general and the restricted DCJ-indel models. We also present a simpler algorithm for computing an optimal restricted DCJ-indel sorting scenario in O(n logn) time.

[1]  Jens Stoye,et al.  Restricted DCJ Model: Rearrangement Problems with Chromosome Reincorporation , 2011, J. Comput. Biol..

[2]  Jens Stoye,et al.  A new linear time algorithm to compute the genomic distance via the double cut and join distance , 2009, Theor. Comput. Sci..

[3]  Cristopher Moore,et al.  The Nature of Computation , 2011 .

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

[5]  Jens Stoye,et al.  UniMoG—a unifying framework for genomic distance calculation and sorting based on DCJ , 2012, Bioinform..

[6]  Marília D. V. Braga,et al.  An Overview of Genomic Distances Modeled with Indels , 2013, CiE.

[7]  Richard Friedberg,et al.  DCJ Path Formulation for Genome Transformations which Include Insertions, Deletions, and Duplications , 2009, J. Comput. Biol..

[8]  Jens Stoye,et al.  On the weight of indels in genomic distances , 2011, BMC Bioinformatics.

[9]  Jens Stoye,et al.  Double Cut and Join with Insertions and Deletions , 2011, J. Comput. Biol..

[10]  Jens Stoye,et al.  Genomic distance under gene substitutions , 2011, BMC Bioinformatics.

[11]  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.

[12]  Jean-Stéphane Varré,et al.  Genome dedoubling by DCJ and reversal , 2011, BMC Bioinformatics.

[13]  Jens Stoye,et al.  Balanced vertices in trees and a simpler algorithm to compute the genomic distance , 2011, Appl. Math. Lett..

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

[15]  Krister M. Swenson,et al.  Phylogenetic Reconstruction from Complete Gene Orders of Whole Genomes , 2008, APBC.

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

[17]  David Sankoff,et al.  The ABCs of MGR with DCJ , 2008, Evolutionary bioinformatics online.

[18]  Simone Dantas,et al.  DCJ-indel and DCJ-substitution distances with distinct operation costs , 2013, Algorithms for Molecular Biology.

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

[20]  Jens Stoye,et al.  On the inversion-indel distance , 2013, BMC Bioinformatics.

[21]  Macha Nikolski,et al.  Genome rearrangements: a correct algorithm for optimal capping , 2007, Inf. Process. Lett..

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

[23]  Simone Dantas,et al.  Restricted DCJ-indel model: sorting linear genomes with DCJ and indels , 2012, BMC Bioinformatics.

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

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