A dynamic programming algorithm for the \(k\)-haplotyping problem

DOI10.1007/s10255-006-0315-6zbMath1130.90412OpenAlexW2005249835MaRDI QIDQ2431961

Ling-Yun Wu, Xiang-Sun Zhang, Yu-Ying Zhao, Zhen-Ping Li

Publication date: 24 October 2006

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-006-0315-6

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Dynamic programming (90C39) Biochemistry, molecular biology (92C40)

Related Items (1)

Parameterized complexity analysis for the closest string with wildcards problem

Cites Work

• A strongly polynomial minimum cost circulation algorithm
• Opportunities for Combinatorial Optimization in Computational Biology
• On the hardness of approximating minimization problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A dynamic programming algorithm for the \(k\)-haplotyping problem