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
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Extending the geometric build-up algorithm for the molecular distance geometry problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2730453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discretization orders for distance geometry problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discretizable molecular distance geometry problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of protein backbones by using artificial backbones of hydrogens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Molecular distance geometry methods: from continuous to discrete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discretizable distance geometry problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4861402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Molecular modeling and simulation. An interdisciplinary guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of semidefinite programming for sensor network localization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigid versus unique determination of protein structures with geometric buildup / rank
 
Normal rank

Latest revision as of 17:29, 6 July 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
    0 references
    distance geometry
    0 references
    protein conformations
    0 references
    NMR data
    0 references
    combinatorial optimization
    0 references
    interval branch and prune
    0 references
    0 references
    0 references