Rearrangement of DNA fragments: a branch-and-cut algorithm.

DOI10.1016/S0166-218X(00)00324-3zbMath1073.90529OpenAlexW2005217735MaRDI QIDQ5957304

Yoshiko Wakabayashi, Carlos E. Ferreira, Cid Carvalho De Souza

Publication date: 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00324-3

zbMATH Keywords

integer programmingbranch-and-cutcomputational biologypolyhedral combinatorics

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Protein sequences, DNA sequences (92D20)

Related Items

Mathematical programming in computational biology: an annotated bibliography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization
• Combinatorial algorithms for DNA sequence assembly
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality