Pages that link to "Item:Q5747881"
From MaRDI portal
The following pages link to MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems (Q5747881):
Displaying 12 items.
- On the computation of protein backbones by using artificial backbones of hydrogens (Q540709) (← links)
- The discretizable molecular distance geometry problem (Q694593) (← links)
- Preface: Special issue dedicated to distance geometry (Q1756744) (← links)
- The discretizable distance geometry problem (Q1926615) (← links)
- Recent advances on the discretizable molecular distance geometry problem (Q1926689) (← links)
- A least-squares approach for discretizable distance geometry problems with inexact distances (Q2174885) (← links)
- An integer programming approach for the search of discretization orders in distance geometry problems (Q2174886) (← links)
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances (Q2392117) (← links)
- On the number of realizations of certain Henneberg graphs arising in protein conformation (Q2448906) (← links)
- Distance Geometry on the Sphere (Q2958102) (← links)
- On a Relationship Between Graph Realizability and Distance Matrix Completion (Q4596149) (← links)
- A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems (Q6155061) (← links)
