#### Filter Results:

- Full text PDF available (45)

#### Publication Year

2007

2017

- This year (1)
- Last 5 years (31)
- Last 10 years (63)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Leo Liberti, Carlile Lavor, Nelson Maculan, Antonio Mucherino
- SIAM Review
- 2014

Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consist of an incomplete set of distances and the output is a set of points in Euclidean space realizing those given distances. We survey the theory of Euclidean distance geometry and its most important… (More)

- Antonio Mucherino, Leo Liberti, Carlile Lavor, Nelson Maculan
- GECCO
- 2009

We consider the Discretizable Molecular Distance Geometry Problem (DMDGP), which consists in a subclass of instances of the distance geometry problem related to molecular conformations for which a combinatorial reformulation can be supplied. We investigate the performances of two different algorithms for solving the DMDGP. The first one is the Branch and… (More)

- Carlile Lavor, Leo Liberti, Nelson Maculan, Antonio Mucherino
- Comp. Opt. and Appl.
- 2012

Given a simple weighted undirected graph G = (V,E, d) with d : E → R+, the Molecular Distance Geometry Problem (MDGP) consists in finding an embedding x : V → R such that ||xu −xv|| = duv for each {u, v} ∈ E. We show that under a few assumptions usually satisfied in proteins, the MDGP can be formulated as a search in a discrete space. We call this MDGP… (More)

- Carlile Lavor, Antonio Mucherino, Leo Liberti, Nelson Maculan
- 2009 International Multiconference on Computer…
- 2009

NMR experiments are able to provide some of the distances between pairs of hydrogen atoms in molecular conformations. The problem of finding the coordinates of such atoms is known as the molecular distance geometry problem. This problem can be reformulated as a combinatorial optimization problem and efficiently solved by an exact algorithm. To this purpose,… (More)

- Antonio Mucherino, Petraq Papajorgji, Panos M. Pardalos
- Operational Research
- 2009

- Antonio Mucherino
- 2011 Federated Conference on Computer Science and…
- 2011

Consistent biclusterings of sets of data are useful for solving feature selection and classification problems. The problem of finding a consistent biclustering can be formulated as a combinatorial optimization problem, and it can be solved by the employment of a recently proposed VNS-based heuristic. In this context, the concept of β-consistent… (More)

- Antonio Mucherino, Georg Ruß
- Industrial Conference on Data Mining - Workshops
- 2011

This survey covers some very recent applications of data mining techniques in the field of agriculture. This is an emerging research field that is experiencing a constant development. In this paper, we first present two applications in this field in details; in particular, we consider the problem of discovering problematic wine fermentations at the early… (More)

- Leo Liberti, Carlile Lavor, Antonio Mucherino, Nelson Maculan
- ITOR
- 2011

Distance geometry problems arise from the need to position entities in the Euclidean K-space given some of their respective distances. Entities may be atoms (molecular distance geometry), wireless sensors (sensor network localization), or abstract vertices of a graph (graph drawing). In the context of molecular distance geometry, the distances are usually… (More)

The Discretizable Molecular Distance Geometry Problem (DMDGP) consists in a subclass of distance geometry instances (related to molecules) that can be solved by combinatorial optimization. A modified version of the Branch and Prune (BP) algorithm, previously proposed for solving these instances, is presented, where it is supposed that exact distances are… (More)

The molecular distance geometry problem can be formulated as the problem of finding an immersion in R<sup>3</sup> of a given undirected, nonnegatively weighted graph <i>G</i>. In this paper, we discuss a set of graphs <i>G</i> for which the problem may also be formulated as a combinatorial search in discrete space. This is theoretically interesting as an… (More)