The discretizable distance geometry problem (Q1926615): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q62562163 / 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: Q5461825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discretization orders for distance geometry problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with the Molecular Distance Geometry Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double variable neighbourhood search with smoothing for the molecular distance geometry problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discretizable molecular distance geometry problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances on the discretizable molecular distance geometry problem / 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: A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins / 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: Global Continuation for Distance Geometry Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance geometry optimization for protein structures / 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: Q3565732 / 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: Q4861402 / 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: An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data / 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 00:22, 6 July 2024

scientific article
Language Label Description Also known as
English
The discretizable distance geometry problem
scientific article

    Statements

    The discretizable distance geometry problem (English)
    0 references
    0 references
    0 references
    0 references
    28 December 2012
    0 references
    distance geometry
    0 references
    DDGP\(_3\)
    0 references
    DMDGP
    0 references
    combinatorial reformulations
    0 references
    branch and prune
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers