Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) BioInfo
Adjustable Chain Trees for Proteins
Rasmus Fonseca

20 September 2012, 14h00 - 20 September 2012, 15h00
Salle/Bat : 445/PCRI-N
Contact :

Activités de recherche :

Résumé :
A chain tree is a data structure for changing protein conformations. It enables very fast detection of clashes and updates of free energy. A modified version of chain trees that adjust themselves to the changing conformations of folding proteins is introduced. This results in much tighter bounding volume hierarchies and therefore fewer intersection checks. Computational results indicate that the efficiency of the adjustable chain trees is improved by 40% compared to the traditional chain trees. Additionally changing the type of bounding volume from the widely used oriented bounding boxes to a capped cylindrical shape (capsule) decreases the update times by another 40%.

Pour en savoir plus :
Séminaires
Measuring Similarity between Logical Arguments
Raisonnement automatique
Monday 06 March 2023 - 00h00
Salle : 0 - 650
Victor David .............................................

Imputing Out-of-Vocabulary Embeddings with LOVE Ma
Langages et systèmes centrés données
Monday 20 February 2023 - 00h00
Salle : 455 - PCRI-N
Lihu Chen .............................................

On the Interplay between Software Product Lines an
Raisonnement automatique
Tuesday 18 October 2022 - 14h15
Salle : 2013 - DIG-Moulon
Vander Alves .............................................

Combining randomized and observational data: Towar
Raisonnement automatique
Thursday 13 October 2022 - 10h30
Salle : 2011 - DIG-Moulon
Bénédicte Colnet .............................................

New Achievements of Artificial Intelligence in Mul
Raisonnement automatique
Tuesday 11 October 2022 - 14h15
Salle : 2013 - DIG-Moulon
.............................................