A guided tour to computational haplotyping

DOI10.1007/978-3-319-58741-7_6zbMATH Open1443.92121OpenAlexW2613616962MaRDI QIDQ2011635FDOQ2011635

Authors: Gunnar W. Klau, Tobias Marschall 

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-58741-7_6

Recommendations

• Computational Methods for SNPs and Haplotype Inference
• The haplotyping problem: an overview of computational models and solutions
• Computational Methods for SNPs and Haplotype Inference
• The pure parsimony haplotyping problem: overview and computational advances
• scientific article; zbMATH DE number 956609
• scientific article
• Theory and algorithms for the haplotype assembly problem
• Algorithmic approaches for the single individual haplotyping problem

zbMATH Keywords

human genomecomputational haplotyping

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Research exposition (monographs, survey articles) pertaining to biology (92-02) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Solving VLSI design and DNA sequencing problems using bipartization of graphs
• The complexity of the single individual SNP haplotyping problem
• Haplotype assembly from aligned weighted SNP fragments

Cited In (2)

• Theory and algorithms for the haplotype assembly problem
• The phasing of heterozygous traits: Algorithms and complexity

Uses Software

• WhatsHap
• HapCol

This page was built for publication: A guided tour to computational haplotyping

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