A class representative model for Pure Parsimony Haplotyping under uncertain data.
The Pure Parsimony Haplotyping (PPH) problem is a NP-hard combinatorial optimization problem that consists of finding the minimum number of haplotypes necessary to explain a given set of genotypes. PPH has attracted more and more attention in recent years due to its importance in analysis of many fi...
| Hlavní autoři: | , , |
|---|---|
| Médium: | Článek |
| Jazyk: | English |
| Vydáno: |
Public Library of Science (PLoS)
2011-01-01
|
| Edice: | PLoS ONE |
| On-line přístup: | http://europepmc.org/articles/PMC3064666?pdf=render |