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

From MaRDI portal
Created claim: Wikidata QID (P12): Q62562157, #quickstatements; #temporary_batch_1708039819900
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 06:59, 5 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
    0 references
    0 references
    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

    Identifiers