The phasing of heterozygous traits: Algorithms and complexity

DOI10.1016/J.CAMWA.2006.12.089MaRDI QIDQ929162zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3598475 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• A polynomial case of the parsimony haplotyping problem
• Computational Methods for SNPs and Haplotype Inference
• Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
• Opportunities for combinatorial optimization in computational biology
• Research in Computational Molecular Biology

Cited in

(3)

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

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)