A symmetry-based splitting strategy for discretizable distance geometry problems
type: Item
instance of: scholarly article
title: A symmetry-based splitting strategy for discretizable distance geometry problems
zbMATH Open document ID: 1405.90134
author: Felipe Fidalgo
author: Douglas S. Gonçalves
author: Leo Liberti
author: Antonio Mucherino
author: Carlile Lavor
published in: Journal of Global Optimization
publication date: 2018-08-29T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6928825
zbMATH Keywords: protein structure determination
zbMATH Keywords: partial reflection
zbMATH Keywords: decomposition
zbMATH Keywords: branch-and-prune
MaRDI profile type: Publication
full work available at URL: s10898-018-0610-9
OpenAlex ID: W2791483268
Wikidata QID: Q62562096
cites work: General introduction to graph partitioning
cites work: The discretizable molecular distance geometry problem
cites work: Recent advances on the discretizable molecular distance geometry problem
cites work: The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
cites work: A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
cites work: Euclidean Distance Geometry and Applications
cites work: Molecular distance geometry methods: from continuous to discrete
cites work: On the number of realizations of certain Henneberg graphs arising in protein conformation
cites work: Distance Geometry in Structural Biology: New Perspectives
cites work: Distance geometry optimization for protein structures
cites work: The discretizable distance geometry problem
cites work: Solving the Discretizable Molecular Distance Geometry Problem by Multiple Realization Trees
cites work: Distributed Algorithms for Message-Passing Systems
DOI: 10.1007/S10898-018-0610-9
description: scientific article; zbMATH DE number 6928825