MD-jeep
From MaRDI portal
Cited in
(17)- The discretizable molecular distance geometry problem seems easier on proteins
- The discretizable molecular distance geometry problem
- A least-squares approach for discretizable distance geometry problems with inexact distances
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- On the computation of protein backbones by using artificial backbones of hydrogens
- Maximum feasible subsystems of distance geometry constraints
- Preface: Special issue dedicated to distance geometry
- Mathematical software -- ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13--17, 2010. Proceedings
- MD-jeep: an implementation of a branch and prune algorithm for distance geometry problems
- TADD
- Xplor-NIH
- Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach
- MinDouble
- MIN REVORDER
- Recent advances on the discretizable molecular distance geometry problem
- The discretizable distance geometry problem
- An integer programming approach for the search of discretization orders in distance geometry problems
This page was built for software: MD-jeep
