Sorting permutations and binary strings by length-weighted rearrangements (Q683752): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2018.01.012 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2018.01.012 / rank
 
Normal rank

Revision as of 07:03, 9 December 2024

scientific article
Language Label Description Also known as
English
Sorting permutations and binary strings by length-weighted rearrangements
scientific article

    Statements

    Sorting permutations and binary strings by length-weighted rearrangements (English)
    0 references
    0 references
    0 references
    0 references
    9 February 2018
    0 references
    genome rearrangements
    0 references
    reversals
    0 references
    transpositions
    0 references
    prefix rearrangements
    0 references
    diameter
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references