Complexity insights of the minimum duplication problem (Q2440167)

From MaRDI portal
Revision as of 13:14, 7 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
Complexity insights of the minimum duplication problem
scientific article

    Statements

    title
    Complexity insights of the minimum duplication problem (English)
    0 references
    author
    Guillaume Blin
    0 references
    Paola Bonizzoni
    0 references
    Riccardo Dondi
    0 references
    Romeo Rizzi
    0 references
    Florian Sikora
    0 references
    publication date
    27 March 2014
    0 references
    zbMATH Keywords
    minimum duplication problem
    0 references
    comparative genomics
    0 references
    computational complexity
    0 references
    APX-hardness
    0 references
    randomized algorithm
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q17
    0 references
    68W20
    0 references
    92-08
    0 references
    92D10
    0 references
    92D15
    0 references
    zbMATH DE Number
    6275057
    0 references
    OpenAlex ID
    W2181191890
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2440167&oldid=35379670"
    Powered by MediaWiki