Computing the graph-based parallel complexity of gene assembly (Q974100)

From MaRDI portal
Revision as of 20:45, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Computing the graph-based parallel complexity of gene assembly
scientific article

    Statements

    title
    Computing the graph-based parallel complexity of gene assembly (English)
    0 references
    author
    Artiom Alhazov
    0 references
    Chang Li
    0 references
    Ion Petre
    0 references
    publication date
    27 May 2010
    0 references
    Mathematics Subject Classification ID
    68Q10
    0 references
    68Q05
    0 references
    68R10
    0 references
    zbMATH DE Number
    5712815
    0 references
    zbMATH Keywords
    gene assembly
    0 references
    parallelism
    0 references
    signed graphs
    0 references
    parallel complexity
    0 references
    algorithmics
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q974100&oldid=12959877"
    Powered by MediaWiki