Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems (Q3599136)

From MaRDI portal
Revision as of 11:58, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems
scientific article

    Statements

    title
    Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems (English)
    0 references
    author
    Michael Elberfeld
    0 references
    Till Tantau
    0 references
    publication date
    3 February 2009
    0 references
    zbMATH Keywords
    bioinformatics
    0 references
    haplotyping
    0 references
    computational complexity
    0 references
    circuit classes
    0 references
    perfect phylogenies
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    92C40
    0 references
    92D10
    0 references
    zbMATH DE Number
    5502050
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3599136&oldid=27912356"
    Powered by MediaWiki