The definition of computational methodologies for the inference of molecular structural information plays a relevant role in disciplines as drug discovery and metabolic engineering, since the functionality of a biochemical molecule is determined by its three-dimensional structure. In this work, we present an automatic methodology to solve the Molecular Distance Geometry Problem, that is, to determine the best three-dimensional shape that satisfies a given set of target inter-atomic distances. In particular, our method is designed to cope with incomplete distance information derived from Nuclear Magnetic Resonance measurements. To tackle this problem, that is known to be NP-hard, we present a memetic method that combines two soft-computing algorithms - Particle Swarm Optimization and Genetic Algorithms - with a local search approach, to improve the effectiveness of the crossover mechanism. We show the validity of our method on a set of reference molecules with a length ranging from 402 to 1003 atoms.

(2014). A memetic hybrid method for the Molecular Distance Geometry Problem with incomplete information [conference presentation - intervento a convegno]. Retrieved from http://hdl.handle.net/10446/30948

A memetic hybrid method for the Molecular Distance Geometry Problem with incomplete information

CAZZANIGA, Paolo;
2014-01-01

Abstract

The definition of computational methodologies for the inference of molecular structural information plays a relevant role in disciplines as drug discovery and metabolic engineering, since the functionality of a biochemical molecule is determined by its three-dimensional structure. In this work, we present an automatic methodology to solve the Molecular Distance Geometry Problem, that is, to determine the best three-dimensional shape that satisfies a given set of target inter-atomic distances. In particular, our method is designed to cope with incomplete distance information derived from Nuclear Magnetic Resonance measurements. To tackle this problem, that is known to be NP-hard, we present a memetic method that combines two soft-computing algorithms - Particle Swarm Optimization and Genetic Algorithms - with a local search approach, to improve the effectiveness of the crossover mechanism. We show the validity of our method on a set of reference molecules with a length ranging from 402 to 1003 atoms.
2014
Nobile, MARCO S.; Citrolo, A. G.; Cazzaniga, Paolo; Besozzi, Daniela; Mauri, Giancarlo
File allegato/i alla scheda:
File Dimensione del file Formato  
memhpg.pdf

Solo gestori di archivio

Descrizione: publisher's version - versione dell'editore
Dimensione del file 3.07 MB
Formato Adobe PDF
3.07 MB Adobe PDF   Visualizza/Apri
Pubblicazioni consigliate

Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10446/30948
Citazioni
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 2
social impact