Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
About LRI
Research themes
Collaborations
Research results
Open positions
Teaching
Useful informations
Séminaire d'équipe(s) Bioinformatics Group
The Discretizable Molecular Distance Geometry Problem
Antonio Mucherino

29 April 2010 15h - 29 April 2010 16h, Salle/Bat : 90/490
Contact : Jerome Aze

Thèmes : Bioinformatics

Résumé :
The Molecular Distance Geometry Problem (MDGP) is the problem of finding the conformation of a molecule starting from some known distances between pairs of its atoms. The MDGP is NP-hard. In its basic form, it is a constraint satisfaction problem, and it is usually reformulated as a global continuous optimization problem. In this seminar, I will discuss a discrete reformulation of the MDGP (the Discretizable MDGP) which brings to the formulation of a combinatorial optimization problem. Even though the MDGP is still NP-hard after the discretization, instances of the problem related to real molecules can be efficiently solved by employing an ad-hoc algorithm: the Branch & Prune algorithm. Recent efforts have been devoted to the management of noise and experimental errors that can affect distances obtained by experimental techniques.

Pour en savoir plus :
Séminaires
Sur la médiane de m permutations
Bioinformatics
4 14 October 2010 - 14h
Salle : 101 (490)
Sylvie Hamel .............................................

TBA
Algorithms
2 12 October 2010 - 11h
Salle : 101 (490)
Ashwin Nayak .............................................

TBA
Bioinformatics
4 07 October 2010 - 15h
Salle : 101 (490)
Xuhui Huang .............................................

TBA
Algorithms
2 28 September 2010 - 14h
Salle : 101 (490)
Yi-Kai Liu .............................................

TBA
Bioinformatics
4 23 September 2010 - 14h
Salle : 101 (490)
Adelene Sim .............................................