Phasing of 2-SNP Genotypes Based on Non-random Mating Model

DOI10.1007/11758525_103zbMATH Open1155.92311OpenAlexW1489435288MaRDI QIDQ3545130FDOQ3545130

Alex Zelikovsky, Dumitru Brinza

Publication date: 9 December 2008

Published in: Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11758525_103

Mathematics Subject Classification ID

Applications of graph theory (05C90) Complexity and performance of numerical algorithms (65Y20) Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10)

Cited In (1)

• Computational Science – ICCS 2005

   Recommendations

• High Performance Computing - HiPC 2003 👍 👎
• On the complexity of SNP block partitioning under the perfect phylogeny model 👍 👎
• Computational Science – ICCS 2005 👍 👎
• A practical exact algorithm for the individual haplotyping problem MEC/GI 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Phasing of 2-SNP Genotypes Based on Non-random Mating Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545130)