Discretization vertex orders in distance geometry (Q499358): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: AMPL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
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.1016/j.dam.2014.08.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017850362 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62562138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discretization orders for distance geometry problems / 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: The discretizable molecular distance geometry problem / 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: Counting the Number of Solutions of KDMDGP Instances / 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: Euclidean Distance Geometry and Applications / 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: On the number of realizations of certain Henneberg graphs arising in protein conformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Identification of Discretization Orders for Distance Geometry with Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discretizable distance geometry problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric science of information. First international conference, GSI 2013, Paris, France, August 28--30, 2013. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Molecular modeling and simulation. An interdisciplinary guide / rank
 
Normal rank

Latest revision as of 20:54, 10 July 2024

scientific article
Language Label Description Also known as
English
Discretization vertex orders in distance geometry
scientific article

    Statements

    Discretization vertex orders in distance geometry (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    molecular conformation
    0 references
    protein
    0 references
    DDGP
    0 references
    DMDGP
    0 references
    re-order
    0 references
    branch-and-prune
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references