Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Computing the Tandem Duplication Distance is NP-Hard - MaRDI portal

Computing the Tandem Duplication Distance is NP-Hard (Q5020832)

From MaRDI portal
scientific article; zbMATH DE number 7453649
Language Label Description Also known as
English
Computing the Tandem Duplication Distance is NP-Hard
scientific article; zbMATH DE number 7453649

    Statements

    title
    Computing the Tandem Duplication Distance is NP-Hard (English)
    0 references
    author
    Manuel Lafond
    0 references
    Binhai Zhu
    0 references
    Peng Zou
    0 references
    publication date
    7 January 2022
    0 references
    zbMATH Keywords
    tandem duplication
    0 references
    text processing
    0 references
    formal languages
    0 references
    computational genomics
    0 references
    FPT algorithms
    0 references

    Identifiers

    DOI
    10.1137/20M1356257
    0 references
    Mathematics Subject Classification ID
    68W32
    0 references
    68Q17
    0 references
    68Q27
    0 references
    68Q45
    0 references
    92D10
    0 references
    zbMATH DE Number
    7453649
    0 references
    arXiv ID
    1906.05266
    0 references
    OpenAlex ID
    W4206496492
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5020832&oldid=37273770"
    Powered by MediaWiki