Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems (Q3599136): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-540-85238-4_24 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1576670503 / rank | |||
Normal rank |
Revision as of 21:32, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems |
scientific article |
Statements
Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems (English)
0 references
3 February 2009
0 references
bioinformatics
0 references
haplotyping
0 references
computational complexity
0 references
circuit classes
0 references
perfect phylogenies
0 references