Edit Distances for Genome Comparisons Based on Non-Local Operations
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
Transforming men into mice (polynomial algorithm for genomic distance problem)
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Parking Functions, Labeled Trees and DCJ Sorting Scenarios
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
A unifying view of genome rearrangements
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
| Hi-index | 0.00 |
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al. , allows to represent most rearrangement events that could happen in multichromosomal genomes, such as inversions, translocations, fusions and fissions. No restriction on the genome structure considering linear and circular chromosomes is imposed. An advantage of this general model is that it leads to considerable algorithmic simplifications. Recently several works concerning the DCJ operation have been published, and in particular an algorithm was proposed to find an optimal DCJ sequence for sorting one genome into another one. Here we study the solution space of this problem and give an easy to compute formula that corresponds to the exact number of optimal DCJ sorting sequences to a particular subset of instances of the problem. In addition, this formula is also a lower bound to the number of sorting sequences to any instance of the problem.