Molecular distance geometry methods: from continuous to discrete (Q3087839): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62562185, #quickstatements; #temporary_batch_1711574657256
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation / 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: Isotropic effective energy simulated annealing searches for low energy molecular cluster states / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel build-up algorithm for global energy minimizations of molecular clusters using effective energy simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances / 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: An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving molecular distance geometry problems by global optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for Unique Graph Realizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Molecule Problem: Exploiting Structure in Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3481172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of deterministic low-discrepancy sequences in global optimization / 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: Double variable neighbourhood search with smoothing for the molecular distance geometry problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Continuation for Distance Geometry Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigid and Flexible Frameworks / 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: Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert'' / 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: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / 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
Property / cites work
 
Property / cites work: The Effective Energy Transformation Scheme as a Special Continuation Approach to Global Optimization with Application to Molecular Conformation / rank
 
Normal rank

Latest revision as of 10:14, 4 July 2024

scientific article
Language Label Description Also known as
English
Molecular distance geometry methods: from continuous to discrete
scientific article

    Statements

    Molecular distance geometry methods: from continuous to discrete (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 August 2011
    0 references
    0 references
    distance geometry
    0 references
    protein conformation
    0 references
    optimization
    0 references
    0 references
    0 references
    0 references
    0 references