An optimization approach to the reconstruction of positional DNA sequencing by hybridization with errors

DOI10.1016/j.ejor.2006.08.031zbMath1128.90032OpenAlexW2050274832MaRDI QIDQ879317

Yu-Ying Zhao, Ling-Yun Wu, Xiang-Sun Zhang, Ji-hong Zhang

Publication date: 11 May 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.08.031

zbMATH Keywords

dynamic programmingbranch and bound algorithmpositional sequencing by hybridizationpositive errors and negative errorsreconstruction of DNA fragment

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (2)

The simplified partial digest problem: approximation and a graph-theoretic model ⋮ An integer programming approach to DNA sequence assembly

Cites Work

• Graph traversals, genes and matroids: An efficient case of the travelling salesman problem
• Tabu search for DNA sequencing with false negatives and false positives
• Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimization approach to the reconstruction of positional DNA sequencing by hybridization with errors