Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
