SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy

The breakpoint distance is one of the most straightforward genome comparison measures. Surprisingly, when it comes to define it precisely for multichromosomal genomes with both linear and circular chromosomes, there is more than one way to go about it. In this paper we study Single-Cut-or-Join (SCJ), a breakpoint-like rearrangement event for which we present linear and polynomial time algorithms that solve several genome rearrangement problems, such as median and halving. For the multichromosomal linear genome median problem, this is the first polynomial time algorithm described, since for other breakpoint distances this problem is NP-hard. These new results may be of value as a speedily computable, first approximation to distances or phylogenies based on more realistic rearrangement models.

[1]  Alberto Caprara.  The Reversal Median Problem , 2003, INFORMS J. Comput..

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

[3]  Dr. Susumu Ohno.  Evolution by Gene Duplication , 1970, Springer Berlin Heidelberg.

[4]  B. Mcclintock.  The origin and behavior of mutable loci in maize , 1950, Proceedings of the National Academy of Sciences.

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

[6]  Sridhar Hannenhalli,et al.  Polynomial-time Algorithm for Computing Translocation Distance Between Genomes , 1995, Discret. Appl. Math..

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

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

[9]  Breakpoint Phylogenies. , 1997, Genome informatics. Workshop on Genome Informatics.

[10]  B. Birren,et al.  Proof and evolutionary analysis of ancient genome duplication in the yeast Saccharomyces cerevisiae , 2004, Nature.

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

[12]  Tzvika Hartman,et al.  A 1.375-Approximation Algorithm for Sorting by Transpositions , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[13]  David Sankoff,et al.  Guided genome halving: hardness, heuristics and the history of the Hemiascomycetes , 2008, ISMB.

[14]  Pavel A. Pevzner,et al.  Colored de Bruijn Graphs and the Genome Halving Problem , 2007, IEEE ACM Trans. Comput. Biol. Bioinform..

[15]  J. Nadeau,et al.  Lengths of chromosomal segments conserved since divergence of man and mouse. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

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

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

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

[19]  T. Dobzhansky,et al.  Inversions in the Third Chromosome of Wild Races of Drosophila Pseudoobscura, and Their Use in the Study of the History of the Species. , 1936, Proceedings of the National Academy of Sciences of the United States of America.

[20]  David Bryant,et al.  The complexity of the breakpoint median problem , 1998 .

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

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

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

[24]  Chin Lung Lu,et al.  Analysis of circular genome rearrangement by fusions, fissions and block-interchanges , 2006, BMC Bioinformatics.

[25]  David Sankoff,et al.  Multichromosomal Genome Median and Halving Problems , 2008, WABI.

[26]  Tandy J. Warnow,et al.  New approaches for reconstructing phylogenies from gene order data , 2001, ISMB.

[27]  David Sankoff,et al.  Genome aliquoting with double cut and join , 2009, BMC Bioinformatics.