MD-jeep is a software for solving distance geometry problems. It is able to solve a subclass of instances of the problem for which a discrete reformulation can be supplied. We refer to this subclass of instances as the Discretizable Molecular Distance Geometry Problem (DMDGP). We employ a Branch & Prune (BP) algorithm for the solution of DMDGPs.

1. MD-jeep on the internet.
2. Source code and examples
3. MD-jeep is included in the KNOPPIX/Math 2010 live DVD.

This page is edited by the icms2010-dvd editing team.