The phasing of heterozygous traits: Algorithms and complexity

DOI10.1016/j.camwa.2006.12.089zbMath1137.92024OpenAlexW2020601866MaRDI QIDQ929162

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

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

Related Items

A new mathematical modeling for pure parsimony haplotyping problem ⋮ The pure parsimony haplotyping problem: overview and computational advances

Cites Work

• A polynomial case of the parsimony haplotyping problem
• Opportunities for Combinatorial Optimization in Computational Biology
• Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
• Computational Methods for SNPs and Haplotype Inference
• Research in Computational Molecular Biology
• Unnamed Item
• Unnamed Item