论文信息 - The Genesis of the DCJ Formula

The Genesis of the DCJ Formula

The formula N−(C+I/2) to compute the number of Double-Cut-and-Join operations needed to transform one genome into another is both simple and easy to prove. When it was published, in 2006, we omitted all details on how it was constructed. In this chapter, we will give an elementary treatment on the intuitions and methods underlying the formula, showing that simplicity is sometimes difficult to achieve. We will also prove that this formula is one among an infinite number of candidates, and that the techniques can be applied to other genomic distances.

Jens Stoye | Anne Bergeron | J. Stoye | Anne Bergeron

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

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

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

[4] João Meidanis,et al. Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes , 2012, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[5] Jens Stoye,et al. Rearrangement Models and Single-Cut Operations , 2009, RECOMB-CG.

[6] João Meidanis,et al. AN ALTERNATIVE ALGEBRAIC FORMALISM FOR GENOME REARRANGEMENTS , 2000 .

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

[8] D. Sankoff,et al. Comparative Genomics: "Empirical And Analytical Approaches To Gene Order Dynamics, Map Alignment And The Evolution Of Gene Families" , 2000 .

[9] T. Dobzhansky,et al. Inversions in the Chromosomes of Drosophila Pseudoobscura. , 1938, Genetics.

[10] João Meidanis,et al. SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.