Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices (Q1026186): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.dam.2008.06.051 / rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.06.051 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2093778504 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3221403 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DAM.2008.06.051 / rank | |||
Normal rank |
Latest revision as of 14:35, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices |
scientific article |
Statements
Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices (English)
0 references
24 June 2009
0 references
haplotyping
0 references
galled-tree networks
0 references
hypergraph
0 references