On the complexity of unsigned translocation distance (Q818147): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Genome Rearrangements and Sorting by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithm for computing translocation distance between genomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming cabbage into turnip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank

Latest revision as of 12:28, 24 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of unsigned translocation distance
scientific article

    Statements

    On the complexity of unsigned translocation distance (English)
    0 references
    0 references
    0 references
    24 March 2006
    0 references
    0 references
    unsigned translocation
    0 references
    NP-hardness
    0 references
    inapproximability
    0 references
    0 references