The phasing of heterozygous traits: Algorithms and complexity

DOI10.1016/J.CAMWA.2006.12.089zbMATH Open1137.92024OpenAlexW2020601866MaRDI QIDQ929162FDOQ929162

Authors: Giuseppe Lancia 

Publication date: 12 June 2008

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.12.089

Recommendations

• Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
• A guided tour to computational haplotyping
• Mathematical models and solutions for the analysis of human genotypes
• Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems
• The pure parsimony haplotyping problem: overview and computational advances

zbMATH Keywords

computational biologyClark's ruleperfect phylogeny haplotypingpure parsimony haplotyping

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Genetics and epigenetics (92D10) Problems related to evolution (92D15) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Title not available (Why is that?)
• A polynomial case of the parsimony haplotyping problem
• Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
• Opportunities for combinatorial optimization in computational biology
• Title not available (Why is that?)
• Computational Methods for SNPs and Haplotype Inference
• Research in Computational Molecular Biology

Cited In (3)

• Mathematical models and solutions for the analysis of human genotypes
• The pure parsimony haplotyping problem: overview and computational advances
• A new mathematical modeling for pure parsimony haplotyping problem

This page was built for publication: The phasing of heterozygous traits: Algorithms and complexity

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