Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices

DOI10.1016/j.dam.2008.06.051zbMath1182.92035OpenAlexW2093778504MaRDI QIDQ1026186

Ján Maňuch, Ladislav Stacho, Xiaohong Zhao, Arvind Kumar Gupta

Publication date: 24 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.06.051

zbMATH Keywords

hypergraphhaplotypinggalled-tree networks

Mathematics Subject Classification ID

Problems related to evolution (92D15) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Systems biology, networks (92C42)

Related Items (2)

Phylogeny- and parsimony-based haplotype inference with constraints ⋮ Haplotype Inferring Via Galled-Tree Networks Is NP-Complete

Cites Work

• Unnamed Item
• Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
• Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms

This page was built for publication: Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices