Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data

DOI10.1007/978-3-642-02017-9_23zbMath1241.68070OpenAlexW2172313090MaRDI QIDQ3630205

Ilka Schnoor, Michael Elberfeld, Till Tantau

Publication date: 3 June 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02017-9_23

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Related Items (2)

Phylogeny- and parsimony-based haplotype inference with constraints ⋮ Influence of tree topology restrictions on the complexity of haplotyping with missing data

This page was built for publication: Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data