The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances (Q2392117): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10898-011-9799-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987458603 / rank | |||
Normal rank | |||
Revision as of 21:05, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances |
scientific article |
Statements
The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances (English)
0 references
1 August 2013
0 references
distance geometry
0 references
protein conformations
0 references
NMR data
0 references
combinatorial optimization
0 references
interval branch and prune
0 references
