The following pages link to Antonio Mucherino (Q476277):
Displaying 38 items.
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry (Q476278) (← links)
- Discretization orders for protein side chains (Q486406) (← links)
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures (Q503659) (← links)
- On the computation of protein backbones by using artificial backbones of hydrogens (Q540709) (← links)
- The discretizable molecular distance geometry problem (Q694593) (← links)
- Data mining in agriculture (Q730790) (← links)
- Understanding the role of the topology in protein folding by computational inverse folding experiments (Q1004912) (← links)
- (Q1032609) (redirect page) (← links)
- A survey of data mining techniques applied to agriculture (Q1032611) (← links)
- A symmetry-based splitting strategy for discretizable distance geometry problems (Q1668793) (← links)
- Recent advances on the interval distance geometry problem (Q1683318) (← links)
- An approach to dynamical distance geometry (Q1689239) (← links)
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) (← links)
- The discretizable distance geometry problem (Q1926615) (← links)
- Recent advances on the discretizable molecular distance geometry problem (Q1926689) (← links)
- The referenced vertex ordering problem: theory, applications, and solution methods (Q2165588) (← links)
- The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry (Q2174889) (← links)
- An application-based characterization of dynamical distance geometry problems (Q2174892) (← links)
- Interior-point solver for large-scale quadratic programming problems with bound constraints (Q2370027) (← 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)
- Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem (Q2660371) (← links)
- Optimal partial discretization orders for discretizable distance geometry (Q2827765) (← links)
- The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins (Q2841697) (← links)
- Distance Geometry in Structural Biology: New Perspectives (Q2841712) (← links)
- Molecular distance geometry methods: from continuous to discrete (Q3087839) (← links)
- Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint (Q3304780) (← links)
- (Q3565732) (← links)
- (Q3576090) (← links)
- Application of Monkey Search Meta-heuristic to Solving Instances of the Multidimensional Assignment Problem (Q3589759) (← links)
- On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1 (Q4609775) (← links)
- (Q5110065) (← links)
- On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem (Q5199160) (← links)
- Euclidean Distance Geometry and Applications (Q5408231) (← links)
- On the Identification of Discretization Orders for Distance Geometry with Intervals (Q5410538) (← links)
- MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems (Q5747881) (← links)
- An impossible combinatorial counting method in distance geometry (Q6558675) (← links)
- On the local and global minimizers of the smooth stress function in Euclidean Distance Matrix problems (Q6740397) (← links)
