New results for the longest haplotype reconstruction problem

DOI10.1016/j.dam.2011.10.014zbMath1260.92089OpenAlexW2072836445MaRDI QIDQ423956

Riccardo Dondi

Publication date: 30 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.014

zbMATH Keywords

computational biologyfixed-parameter algorithmsapproximation complexity

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On approximating the longest path in a graph
• Some APX-completeness results for cubic graphs
• The haplotyping problem: an overview of computational models and solutions
• The complexity of the single individual SNP haplotyping problem
• Opportunities for Combinatorial Optimization in Computational Biology
• Proof verification and the hardness of approximation problems
• Color-coding
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• The complexity of satisfiability problems
• On the complexity of comparing evolutionary trees

This page was built for publication: New results for the longest haplotype reconstruction problem