On the complexity and approximation of syntenic distance (Q1281760): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Q487017 / rank
Normal rank
 
Property / author
 
Property / author: Bhaskar Das Gupta / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234063 / 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: Q4739657 / rank
 
Normal rank

Latest revision as of 18:04, 28 May 2024

scientific article
Language Label Description Also known as
English
On the complexity and approximation of syntenic distance
scientific article

    Statements

    On the complexity and approximation of syntenic distance (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 June 1999
    0 references
    computational complexity
    0 references

    Identifiers