An exact algorithm for side-chain placement in protein design

DOI10.1007/s11590-011-0308-0zbMath1259.90150arXiv1103.1503OpenAlexW3098215245MaRDI QIDQ691432

Stefan Canzar, Nora C. Toussaint, Gunnar W. Klau

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.1503

zbMATH Keywords

Lagrangian relaxationbranch-and-boundalgorithm engineeringprotein designside-chain placement

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Boolean programming (90C09)

Related Items (1)

Global energy minimisation and cotranslational protein folding of HP models

Uses Software

• LEDA
• BALL

Cites Work

• A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies
• Fast and accurate algorithms for protein side-chain packing
• The traveling-salesman problem and minimum spanning trees: Part II
• Unnamed Item
• Unnamed Item

This page was built for publication: An exact algorithm for side-chain placement in protein design