The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances (Q2392117)

From MaRDI portal
Revision as of 00:44, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    1 August 2013
    0 references
    0 references
    distance geometry
    0 references
    protein conformations
    0 references
    NMR data
    0 references
    combinatorial optimization
    0 references
    interval branch and prune
    0 references