An exact algorithm for side-chain placement in protein design (Q691432): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4702188 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast and accurate algorithms for protein side-chain packing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3174025 / rank | |||
Normal rank | |||
Latest revision as of 22:16, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact algorithm for side-chain placement in protein design |
scientific article |
Statements
An exact algorithm for side-chain placement in protein design (English)
0 references
30 November 2012
0 references
Lagrangian relaxation
0 references
branch-and-bound
0 references
algorithm engineering
0 references
protein design
0 references
side-chain placement
0 references
0 references
