On sorting unsigned permutations by double-cut-and-joins (Q2377380)

From MaRDI portal
Revision as of 15:00, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On sorting unsigned permutations by double-cut-and-joins
scientific article

    Statements

    On sorting unsigned permutations by double-cut-and-joins (English)
    0 references
    0 references
    28 June 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    genome rearrangement
    0 references
    double-cut-and-joins
    0 references
    breakpoint graph decomposition
    0 references
    fractional linear programming
    0 references
    0 references