The Longest Haplotype Reconstruction Problem Revisited
From MaRDI portal
Publication:3183601
DOI10.1007/978-3-642-03409-1_11zbMATH Open1252.68351OpenAlexW1961404062MaRDI QIDQ3183601
Publication date: 20 October 2009
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03409-1_11
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)
Related Items (1)
This page was built for publication: The Longest Haplotype Reconstruction Problem Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183601)