75 research outputs found

    On the complexity of unsigned translocation distance

    Get PDF
    Translocation is one of the basic operations for genome rearrangement. Translocation distance is the minimum number of translocations required to transform one genome into the other. In this paper, we show that computing the translocation distance for unsigned genomes is NP-hard. Moreover, we show that approximating the translocation distance for unsigned genomes within ratio 1.00017 is NP-hard

    An Exact Algorithm for the Zero Exemplar Breakpoint Distance Problem

    No full text
    corecore