Alberto Caprara: Sorting permutations by reversals and Eulerian cycle decompositions, SIAM Journal of Discrete Mathematics 12 (1999), 91--110. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Combinatorial Methods in Comparative Genomics - Eriksen (2003) (Correct)
....on the program Derange, which is discussed in Chapter 3 and Section 1.3.4, improving on Derange by looking at all optimal sequences of operations, while being limited to only one kind of operation. For unsigned genomes, calculating the reversal distance is NP hard, as was shown by Caprara [16]. The proof consists of a series of transformations. For unsigned genomes, the vertices 2k and 2k in the breakpoint graph are identified for all k [n] It then becomes a problem to compute the maximum number of alternating cycles. Caprara is able to reduce this problem to the reversal ....
Alberto Caprara: Sorting permutations by reversals and Eulerian cycle decompositions, SIAM Journal of Discrete Mathematics 12 (1999), 91--110.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC