Lavor Carlile

Carlile Lavor

Information about the author Carlile Lavor will soon be added to the site.
Found 7 papers in total
Feasibility check for the distance geometry problem: an application to molecular conformations
Feasibility check for the distance geometry problem: an application to molecular conformations
2017
The distance geometry problem (DGP) consists in finding an embedding in a metric space...
Six mathematical gems from the history of distance geometry
Six mathematical gems from the history of distance geometry
2016
This is a partial account of the fascinating history of distance geometry. We make no...
The interval Branch‐and‐Prune algorithm for the discretizable molecular distance geometry problem with inexact distances
The interval Branch‐and‐Prune algorithm for the discretizable molecular distance geometry problem with inexact distances
2013
The Distance Geometry Problem in three dimensions consists in finding an embedding in...
Discretization orders for distance geometry problems
Discretization orders for distance geometry problems
2012
Given a weighted, undirected simple graph G = ( V , E , d ) (where d : E → ℝ...
Recent advances on the Discretizable Molecular Distance Geometry Problem
Recent advances on the Discretizable Molecular Distance Geometry Problem
2012
The Molecular Distance Geometry Problem (MDGP) consists in finding an embedding in...
Hyperbolic smoothing and penalty techniques applied to molecular structure determination
Hyperbolic smoothing and penalty techniques applied to molecular structure determination
2011
This work considers the problem of estimating the relative positions of all atoms of a...
A branch-and-prune algorithm for the molecular distance geometry problem
A branch-and-prune algorithm for the molecular distance geometry problem
2008
The Molecular Distance Geometry Problem consists in finding the positions in R 3 of...
Papers per page: