Polynomial-time algorithm for computing translocation distance between genomes (Q5961622): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Genome Rearrangements and Sorting by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3364218 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068426944 / rank
 
Normal rank

Latest revision as of 09:54, 30 July 2024

scientific article; zbMATH DE number 981919
Language Label Description Also known as
English
Polynomial-time algorithm for computing translocation distance between genomes
scientific article; zbMATH DE number 981919

    Statements

    Polynomial-time algorithm for computing translocation distance between genomes (English)
    0 references
    25 February 1997
    0 references
    translocation distance problem
    0 references
    duality theorem
    0 references

    Identifiers

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