Search

Your search keyword '"Algorithms for Modeling and Simulation of Nanosystems ( NANO-D )"' showing total 19 results
Start Over Author "Algorithms for Modeling and Simulation of Nanosystems ( NANO-D )" Search Limiters Peer Reviewed
19 results on '"Algorithms for Modeling and Simulation of Nanosystems ( NANO-D )"'

1. Analytical symmetry detection in protein assemblies. II. Dihedral and cubic symmetries

Author

Guillaume Pagès, Sergei Grudinin, Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), and Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])

Subjects
0301 basic medicine, Protein Structure, Protein Conformation, Icosahedral symmetry, Symmetry group, Dihedral angle, Crystallography, X-Ray, Topology, 03 medical and health sciences, Discrete Optimization, Structural Biology, Molecular symmetry, [SDV.BBM]Life Sciences [q-bio]/Biochemistry, Molecular Biology, Databases, Protein, Continuous Optimization, Physics, Quantitative Biology::Biomolecules, Point-Group Symmetry, Proteins, computer.file_format, Protein Data Bank, Cubic Groups, 030104 developmental biology, Group Theory, Tetrahedron, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Symmetry (geometry), computer, Algorithms, Software, Group theory
Abstract

International audience; Protein assemblies are often symmetric, as this organization has many advantages compared to individual proteins. Complex protein structures thus very often possess high-order symmetries. Detection and analysis of these symmetries has been a challenging problem and no efficient algorithms have been developed so far. This paper presents the extension of our cyclic symmetry detection method for higher-order symmetries with multiple symmetry axes. These include dihedral and cubic, i.e., tetrahedral, octahedral, and icosa-hedral, groups. Our method assesses the quality of a particular symmetry group and also determines all of its symmetry axes with a machine precision. The method comprises discrete and continuous optimization steps and is applicable to assemblies with multiple chains in the asymmetric subunits or to those with pseudo-symmetry. We implemented the method in C++ and exhaustively tested it on all 51,358 symmetrical assemblies from the Protein Data Bank (PDB). It allowed us to study structural organization of symmetrical assemblies solved by X-ray crystallography, and also to assess the symmetry annotation in the PDB. For example, in 1.6% of the cases we detected a higher symmetry group compared to the PDB annotation, and we also detected several cases with incorrect annotation. The method is available at http://team.inria.fr/nano-d/software/ananas. The graphical user interface of the method built for the SAMSON platform is available at http://samson-connect.net.

Published
2018
Full Text
View/download PDF

2. Analytical symmetry detection in protein assemblies. I. Cyclic symmetries

Author

Guillaume Pagès, Sergei Grudinin, Elvira Kinzina, Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), and Moscow Institute of Physics and Technology [Moscow] (MIPT)

Subjects
0301 basic medicine, Cyclic symmetry in three dimensions, Protein Structure, Computer science, Protein Assemblies, Topology, Machine epsilon, 03 medical and health sciences, Structural Biology, Position (vector), Euclidean geometry, Molecular symmetry, Databases, Protein, Continuous Optimization, Point-Group Symmetry, Proteins, computer.file_format, Function (mathematics), Protein Data Bank, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, 030104 developmental biology, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Symmetry (geometry), computer, Algorithms, Software
Abstract

International audience; Symmetry in protein, and, more generally, in macromolecular assemblies is a key point to understand their structure, stability and function. Many symmetrical assemblies are currently present in the Protein Data Bank (PDB) and some of them are among the largest solved structures, thus an efficient computational method is needed for the exhaustive analysis of these. The cyclic symmetry groups represent the most common assemblies in the PDB. These are also the building blocks for higher-order symmetries. This paper presents a mathematical formulation to find the position and the orientation of the symmetry axis in a cyclic symmetrical protein assembly, and also to assess the quality of this symmetry. Our method can also detect symmetries in partial assemblies. We provide an efficient C++ implementation of the method and demonstrate its efficiency on several examples including partial assemblies and pseudo symmetries. We also compare the method with two other published techniques and show that it is significantly faster on all the tested examples. Our method produces results with a machine precision, its cost function is solely based on 3D Euclidean geometry, and most of the operations are performed analytically. The method is available at http://team.inria.fr/nano-d/software/ananas. The graphical user interface of the method built for the SAMSON platform is available at http://samson-connect.net.

Published
2018
Full Text
View/download PDF

3. IM-UFF: Extending the universal force field for interactive molecular modeling

Author

Léonard Jaillet, Stephane Redon, Svetlana Artemova, Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), and Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])

Subjects
Models, Molecular, Theoretical computer science, Molecular perception, Molecular model, Computer science, Molecular Dynamics Simulation, Time step, Molecular systems, 010402 general chemistry, Network topology, 01 natural sciences, Force field (chemistry), Computational science, Software, 0103 physical sciences, Materials Chemistry, Physical and Theoretical Chemistry, Interactive simulation, Spectroscopy, Internet, Molecular Structure, 010304 chemical physics, business.industry, Physics based, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Computer Graphics and Computer-Aided Design, 0104 chemical sciences, Universality (dynamical systems), Empirical force fields, Universal Force Field, Interactive modeling, business
Abstract

International audience; The universal force field (UFF) is a broadly applicable classical force field that contains parameters for almost every atom type of the periodic table. This force field is non-reactive, i.e. the topology of the system under study is considered as fixed and no creation or breaking of covalent bonds is possible. This paper introduces interactive modeling-UFF (IM-UFF), an extension of UFF that combines the possibility to significantly modify molecular structures (as with reactive force fields) with a broad diversity of supported systems thanks to the universality of UFF. Such an extension lets the user easily build and edit molecular systems interactively while being guided by physics based inter-atomic forces. This approach introduces weighted atom types and weighted bonds, used to update topologies and atom parameterizations at every time step of a simulation. IM-UFF has been evaluated on a large set of benchmarks and is proposed as a self-contained implementation integrated in a new module for the SAMSON software platform for computational nanoscience available at http://www.samson-connect.net.

Published
2017
Full Text
View/download PDF

4. Convex-PL: a novel knowledge-based potential for protein-ligand interactions deduced from structural databases using convex optimization

Author

Sergei Grudinin, Maria Kadukova, Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), and Moscow Institute of Physics and Technology [Moscow] (MIPT)

Subjects
0301 basic medicine, Optimization problem, Protein Conformation, Computer science, Knowledge Bases, [PHYS.PHYS.PHYS-BIO-PH]Physics [physics]/Physics [physics]/Biological Physics [physics.bio-ph], Protein-ligand interactions, Ligands, computer.software_genre, Structure-Activity Relationship, 03 medical and health sciences, Polynomial basis, Knowledge-based potential, Scoring functions for docking, Software, Machine learning, Drug Discovery, Humans, Physical and Theoretical Chemistry, Databases, Protein, Binding Sites, Molecular Structure, business.industry, Regular polygon, Proteins, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], Computer Science Applications, Molecular Docking Simulation, 030104 developmental biology, Docking (molecular), Drug Design, Molecular docking, Convex optimization, Data mining, Scoring function, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], business, Algorithm, computer, Algorithms, [CHIM.CHEM]Chemical Sciences/Cheminformatics, Protein Binding, Protein ligand
Abstract

We present a novel optimization approach to train a free-shape distance-dependent protein-ligand scoring function called Convex-PL. We do not impose any functional form of the scoring function. Instead, we decompose it into a polynomial basis and deduce the expansion coefficients from the structural knowledge base using a convex formulation of the optimization problem. Also, for the training set we do not generate false poses with molecular docking packages, but use constant RMSD rigid-body deformations of the ligands inside the binding pockets. This allows the obtained scoring function to be generally applicable to scoring of structural ensembles generated with different docking methods. We assess the Convex-PL scoring function using data from D3R Grand Challenge 2 submissions and the docking test of the CASF 2013 study. We demonstrate that our results outperform the other 20 methods previously assessed in CASF 2013. The method is available at http://team.inria.fr/nano-d/software/Convex-PL/ .

Published
2017
Full Text
View/download PDF

5. As-Rigid-As-Possible molecular interpolation paths

Author

Minh Khoa Nguyen, Stephane Redon, Léonard Jaillet, Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), and Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])

Subjects
Models, Molecular, 0301 basic medicine, Theoretical computer science, Protein Conformation, Computer science, 02 engineering and technology, Molecular systems, Molecular conformation, Interpolation path, Computer graphics, 03 medical and health sciences, As-rigid-as-possible, Drug Discovery, Computer Graphics, 0202 electrical engineering, electronic engineering, information engineering, Animals, Humans, Computer Simulation, Polygon mesh, Physical and Theoretical Chemistry, Adaptation (computer science), Morphing, Molecular structures, Proteins, 020207 software engineering, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Computer Science Applications, 030104 developmental biology, Large set (Ramsey theory), Algorithm, Algorithms, Software, Interpolation
Abstract

International audience; This paper proposes a new method to generate interpolation paths between two given molecular conformations. It relies on the As-Rigid-As-Possible (ARAP) paradigm used in Computer Graphics to manipulate complex meshes while preserving their essential structural characteristics. The adaptation of ARAP approaches to the case of molecular systems is presented in this contribution. Experiments conducted on a large set of benchmarks show how such a strategy can efficiently compute relevant interpolation paths with large conformational rearrangements.

Published
2017
Full Text
View/download PDF

6. PEPSI-Dock: a detailed data-driven protein–protein interaction potential accelerated by polar Fourier correlation

Author

Petr Popov, David W. Ritchie, Emilie Neveu, Sergei Grudinin, Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Computational Algorithms for Protein Structures and Interactions (CAPSID), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Complex Systems, Artificial Intelligence & Robotics (LORIA - AIS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), and Moscow Institute of Physics and Technology [Moscow] (MIPT)

Subjects
0301 basic medicine, Statistics and Probability, Binding free energy, Protein Conformation, Computer science, Molecular Conformation, Docking proteines, Machine learning, computer.software_genre, Biochemistry, Molecular Docking Simulation, Molecular conformation, Protein–protein interaction, Machine Learning, 03 medical and health sciences, Protein structure, DOCK, Native state, Macromolecular docking, Protein Interactions, Molecular Biology, business.industry, Proteins, Models, Theoretical, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Computer Science Applications, Computational Mathematics, 030104 developmental biology, Computational Theory and Mathematics, Docking (molecular), Artificial intelligence, business, computer, Algorithm, Algorithms, Protein Binding
Abstract

Motivation Docking prediction algorithms aim to find the native conformation of a complex of proteins from knowledge of their unbound structures. They rely on a combination of sampling and scoring methods, adapted to different scales. Polynomial Expansion of Protein Structures and Interactions for Docking (PEPSI-Dock) improves the accuracy of the first stage of the docking pipeline, which will sharpen up the final predictions. Indeed, PEPSI-Dock benefits from the precision of a very detailed data-driven model of the binding free energy used with a global and exhaustive rigid-body search space. As well as being accurate, our computations are among the fastest by virtue of the sparse representation of the pre-computed potentials and FFT-accelerated sampling techniques. Overall, this is the first demonstration of a FFT-accelerated docking method coupled with an arbitrary-shaped distance-dependent interaction potential. Results First, we present a novel learning process to compute data-driven distant-dependent pairwise potentials, adapted from our previous method used for rescoring of putative protein–protein binding poses. The potential coefficients are learned by combining machine-learning techniques with physically interpretable descriptors. Then, we describe the integration of the deduced potentials into a FFT-accelerated spherical sampling provided by the Hex library. Overall, on a training set of 163 heterodimers, PEPSI-Dock achieves a success rate of 91% mid-quality predictions in the top-10 solutions. On a subset of the protein docking benchmark v5, it achieves 44.4% mid-quality predictions in the top-10 solutions when starting from bound structures and 20.5% when starting from unbound structures. The method runs in 5–15 min on a modern laptop and can easily be extended to other types of interactions. Availability and Implementation https://team.inria.fr/nano-d/software/PEPSI-Dock. Contact sergei.grudinin@inria.fr

Published
2016
Full Text
View/download PDF

7. Knodle: A Support Vector Machines-Based Automatic Perception of Organic Molecules from 3D Coordinates

Author

Sergei Grudinin, Maria Kadukova, Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), and Moscow Institute of Physics and Technology [Moscow] (MIPT)

Subjects
0301 basic medicine, Informatics, Support Vector Machine, Computer science, protein ligand docking, SVM, General Chemical Engineering, Library and Information Sciences, Ligands, computer.software_genre, 01 natural sciences, Set (abstract data type), Automation, 03 medical and health sciences, Software, [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], 3D structure perception, 0103 physical sciences, Organic Chemicals, 010304 chemical physics, business.industry, Atom (order theory), General Chemistry, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Computer Science Applications, Molecular Weight, Data set, Support vector machine, machine learning, 030104 developmental biology, Protein–ligand docking, Benchmark (computing), Data mining, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], business, Algorithm, computer, Algorithms
Abstract

International audience; Here we address the problem of the assignment of atom types and bond orders in low molecular weight compounds. For this purpose, we have developed a prediction model based on nonlinear Support Vector Machines (SVM), implemented in a KNOwledge-Driven Ligand Extractor called Knodle, a software library for the recognition of atomic types, hybridization states, and bond orders in the structures of small molecules. We trained the model using an excessive amount of structural data collected from the PDBbindCN database. Accuracy of the results and the running time of our method is comparable with other popular methods, such as NAOMI, fconv, and I-interpret. On the popular Labute’s benchmark set consisting of 179 protein–ligand complexes, Knodle makes five to six perception errors, NAOMI makes seven errors, I-interpret makes nine errors, and fconv makes 13 errors. On a larger set of 3,000 protein–ligand structures collected from the PDBBindCN general data set (v2014), Knodle and NAOMI have a comparable accuracy of approximately 3.9% and 4.7% of errors, I-interpret made 6.0% of errors, while fconv produced approximately 12.8% of errors. On a more general set of 332,974 entries collected from the Ligand Expo database, Knodle made 4.5% of errors. Overall, our study demonstrates the efficiency and robustness of nonlinear SVM in structure perception tasks. Knodle is available at https://team.inria.fr/nano-d/software/Knodle.

Published
2016
Full Text
View/download PDF

8. Error Analysis of Modified Langevin Dynamics

Author

Stephane Redon, Gabriel Stoltz, Zofia Trstanova, Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Centre d'Enseignement et de Recherche en Mathématiques et Calcul Scientifique (CERMICS), École des Ponts ParisTech (ENPC), MATHematics for MatERIALS (MATHERIALS), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre d'Enseignement et de Recherche en Mathématiques et Calcul Scientifique (CERMICS), École des Ponts ParisTech (ENPC)-École des Ponts ParisTech (ENPC), ANR-14-CE23-0012,COSMOS,Statistique numérique et simulation moléculaire(2014), École des Ponts ParisTech (ENPC)-École des Ponts ParisTech (ENPC)-Inria de Paris, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Physics, Work (thermodynamics), Statistical Mechanics (cond-mat.stat-mech), Monte Carlo method, Ergodicity, FOS: Physical sciences, Statistical and Nonlinear Physics, Numerical Analysis (math.NA), 010103 numerical & computational mathematics, 01 natural sciences, Hypoelliptic operator, 0103 physical sciences, FOS: Mathematics, Ergodic theory, Variance reduction, Mathematics - Numerical Analysis, Statistical physics, [PHYS.COND.CM-SM]Physics [physics]/Condensed Matter [cond-mat]/Statistical Mechanics [cond-mat.stat-mech], 0101 mathematics, 010306 general physics, Galerkin method, Langevin dynamics, Condensed Matter - Statistical Mechanics, Mathematical Physics
Abstract

International audience; We consider Langevin dynamics associated with a modified kinetic energy vanishing for small momenta. This allows us to freeze slow particles, and hence avoid the re-computation of inter-particle forces, which leads to computational gains. On the other hand, the statistical error may increase since there are a priori more correlations in time. The aim of this work is first to prove the ergodicity of the modified Langevin dynamics (which fails to be hypoelliptic), and next to analyze how the asymptotic variance on ergodic averages depends on the parameters of the modified kinetic energy. Numerical results illustrate the approach, both for low-dimensional systems where we resort to a Galerkin approximation of the generator, and for more realistic systems using Monte Carlo simulations.

Published
2016
Full Text
View/download PDF

9. Incremental solver for orbital-free density functional theory

Author

François Rousse, Stephane Redon, Algorithms for Modeling and Simulating Nanosystems [2018-...] (NANO-D-POST [2018-2020]), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), and Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])

Subjects
Particle system, 010304 chemical physics, Computer science, Orbital-free density functional theory, Adaptively Restrained Particle Simulations, Context (language use), General Chemistry, Solver, 010402 general chemistry, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, 01 natural sciences, Incremental algorithm, 0104 chemical sciences, Orbital-Free DFT, Computational Mathematics, 0103 physical sciences, Particle, Density functional theory, Ab-initio molecular dynamic, Statistical physics, Real-Space Finite-Differences
Abstract

First-principle calculations are still a challenge since they require a great amount of computational time. In this article, we introduce a new algorithm to perform orbital-free density functional theory (OF-DFT) calculations. Our new algorithm focuses computational efforts on important parts of the particle system, which, in the context of adaptively restrained particle simulations (ARPS) allows us to accelerate particle simulations. © 2019 Wiley Periodicals, Inc.

Published
2019
Full Text
View/download PDF

10. Hydroxylation of antitubercular drug candidate, SQ109, by mycobacterial cytochrome P450

Author

A. A. Gilep, Sergei Grudinin, Sergey Bukhdruker, Anton Kavaleuski, Polina Shabunya, Maria Kadukova, Irina Grabovec, Tatsiana Varaksa, Egor Marin, Anastasiia Gusach, Valentin Borshchevskiy, Natallia Strushkevich, Moscow Institute of Physics and Technology [Moscow] (MIPT), Institute of Bioorganic Chemistry, NASB, Minsk, National Academy of Sciences of Belarus (NASB), Algorithms for Modeling and Simulating Nanosystems [2018-...] (NANO-D-POST [2018-2020]), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Institute of Biomedical Chemistry [Moscou] (IBMC), MT-Medicals LLC [Moscou], Jülich Center for Structural Biology [Jülich] (JuStruct), Institute of Biological Information Processing [Jülich] (IBI-7), Skolkovo Institute of Science and Technology [Moscow] (Skoltech), Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Kuntzmann (LJK), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), and Université Grenoble Alpes (UGA)

Subjects
Drug, crystal structure, Cytochrome, cytochrome P450, media_common.quotation_subject, [PHYS.PHYS.PHYS-BIO-PH]Physics [physics]/Physics [physics]/Biological Physics [physics.bio-ph], SQ109, Antitubercular Agents, Adamantane, Hydroxylation, Article, Mycobacterium tuberculosis, lcsh:Chemistry, 03 medical and health sciences, chemistry.chemical_compound, Pharmacokinetics, Cytochrome P-450 Enzyme System, CYP124, lcsh:QH301-705.5, 030304 developmental biology, media_common, 0303 health sciences, Binding Sites, biology, 030306 microbiology, Cytochrome P450, Monooxygenase, respiratory system, biology.organism_classification, bacterial infections and mycoses, Ethylenediamines, 3. Good health, Molecular Docking Simulation, chemistry, Biochemistry, lcsh:Biology (General), lcsh:QD1-999, ddc:540, biology.protein, Protein Binding
Abstract

Spreading of the multidrug-resistant (MDR) strains of the one of the most harmful pathogen Mycobacterium tuberculosis (Mtb) generates the need for new effective drugs. SQ109 showed activity against resistant Mtb and already advanced to Phase II/III clinical trials. Fast SQ109 degradation is attributed to the human liver Cytochrome P450s (CYPs). However, no information is available about interactions of the drug with Mtb CYPs. Here, we show that Mtb CYP124, previously assigned as a methyl-branched lipid monooxygenase, binds and hydroxylates SQ109 in vitro. A 1.25 &Aring, resolution crystal structure of the CYP124&ndash, SQ109 complex unambiguously shows two conformations of the drug, both positioned for hydroxylation of the &omega, methyl group in the trans position. The hydroxylated SQ109 presumably forms stabilizing H-bonds with its target, Mycobacterial membrane protein Large 3 (MmpL3). We anticipate that Mtb CYPs could function as analogs of drug-metabolizing human CYPs affecting pharmacokinetics and pharmacodynamics of antitubercular (anti-TB) drugs.

Published
2020
Full Text
View/download PDF

11. Interactive Chemical Reactivity Exploration

Author

Moritz P. Haag, Mael Bosson, Stephane Redon, Markus Reiher, Alain C. Vaucher, Laboratorium für Physikalische Chemie (ETH-LPC), Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology [Zürich] (ETH Zürich), Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Kuntzmann (LJK), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), and Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])

Subjects
Chemical Physics (physics.chem-ph), Condensed Matter - Materials Science, Structure modification, potential energy surfaces, Computer science, haptic quantum chemistry, Materials Science (cond-mat.mtrl-sci), FOS: Physical sciences, Computational Physics (physics.comp-ph), interactive quantum chemistry, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Atomic and Molecular Physics, and Optics, Simultaneous perception, Human–computer interaction, Physics - Chemical Physics, Pointer (computer programming), Physical and Theoretical Chemistry, real-time quantum chemistry, Physics - Computational Physics, Quantum, chemical reactivity, Haptic technology, Intuition
Abstract

Elucidating chemical reactivity in complex molecular assemblies of a few hundred atoms is, despite the remarkable progress in quantum chemistry, still a major challenge. Black-box search methods to find intermediates and transition-state structures might fail in such situations because of the high-dimensionality of the potential energy surface. Here, we propose the concept of interactive chemical reactivity exploration to effectively introduce the chemist's intuition into the search process. We employ a haptic pointer device with force-feedback to allow the operator the direct manipulation of structures in three dimensions along with simultaneous perception of the quantum mechanical response upon structure modification as forces. We elaborate on the details of how such an interactive exploration should proceed and which technical difficulties need to be overcome. All reactivity-exploration concepts developed for this purpose have been implemented in the Samson programming environment., 36 pages, 14 figures

Published
2014
Full Text
View/download PDF

12. HermiteFit: fast-fitting atomic structures into a low-resolution density map using three-dimensional orthogonal Hermite functions

Author

Georgy Derevyanko, Sergei Grudinin, Institute of Complex Systems (ICS), Forschungszentrum Jülich GmbH | Centre de recherche de Juliers, Helmholtz-Gemeinschaft = Helmholtz Association-Helmholtz-Gemeinschaft = Helmholtz Association, Institut de biologie structurale (IBS - UMR 5075 ), Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut de Recherche Interdisciplinaire de Grenoble (IRIG), Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Centre National de la Recherche Scientifique (CNRS), Moscow Institute of Physics and Technology [Moscow] (MIPT), Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Kuntzmann (LJK), Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF), ANR-11-MONU-0006,PEPSI,Expansions Polynomiales de Structures de Protéines et Interactions(2011), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut de Recherche Interdisciplinaire de Grenoble (IRIG), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), and Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])

Subjects
Hermite spline, Protein Conformation, Fast Fourier transform, Basis function, density fitting, Cubic Hermite spline, symbols.namesake, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, Structural Biology, Hermite interpolation, HermiteFit, [CHIM.CRIS]Chemical Sciences/Cristallography, Cryo-EM, [INFO.INFO-MS]Computer Science [cs]/Mathematical Software [cs.MS], Mathematics, Crystallography, Hermite polynomials, [SDV.BBM.BS]Life Sciences [q-bio]/Biochemistry, Molecular Biology/Structural Biology [q-bio.BM], spherical harmonics, Spherical harmonics, Chaperonin 60, General Medicine, fast Fourier transform, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Hermite orthogonal polynomials, Fourier transform, symbols, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Conotoxins, Algorithm, Algorithms
Abstract

HermiteFit, a novel algorithm for fitting a protein structure into a low-resolution electron-density map, is presented. The algorithm accelerates the rotation of the Fourier image of the electron density by using three-dimensional orthogonal Hermite functions. As part of the new method, an algorithm for the rotation of the density in the Hermite basis and an algorithm for the conversion of the expansion coefficients into the Fourier basis are presented.HermiteFitwas implemented using the cross-correlation or the Laplacian-filtered cross-correlation as the fitting criterion. It is demonstrated that in the Hermite basis the Laplacian filter has a particularly simple form. To assess the quality of density encoding in the Hermite basis, an analytical way of computing the crystallographicRfactor is presented. Finally, the algorithm is validated using two examples and its efficiency is compared with two widely used fitting methods,ADP_EMandcoloresfrom theSituspackage.HermiteFitwill be made available at http://nano-d.inrialpes.fr/software/HermiteFit or upon request from the authors.

Published
2014
Full Text
View/download PDF

13. Blind prediction of homo- and hetero- protein complexes: The CASP13-CAPRI experiment

Author

Lensink, Marc F., Brysbaert, Guillaume, Nadzirin, Nurul, Velankar, Sameer, Chaleil, Raphaël A. G., Gerguri, Tereza, Bates, Paul A., Laine, Elodie, Carbone, Alessandra, Grudinin, Sergei, Kong, Ren, Liu, Ran-Ran, Xu, Xi-Ming, Shi, Hang, Chang, Shan, Eisenstein, Miriam, Karczynska, Agnieszka, Czaplewski, Cezary, Lubecka, Emilia, Lipska, Agnieszka, Krupa, Paweł, Mozolewska, Magdalena, Golon, Łukasz, Samsonov, Sergey, Liwo, Adam, Crivelli, Silvia, Pagès, Guillaume, Karasikov, Mikhail, Kadukova, Maria, Yan, Yumeng, Huang, Sheng-You, Rosell, Mireia, Rodríguez-Lumbreras, Luis A., Romero-Durana, Miguel, Díaz-Bueno, Lucía, Fernandez-Recio, Juan, Christoffer, Charles, Terashi, Genki, Shin, Woong-Hee, Aderinwale, Tunde, Maddhuri Venkata Subraman, Sai Raghavendra, Kihara, Daisuke, Kozakov, Dima, Vajda, Sandor, Porter, Kathryn, Padhorny, Dzmitry, Desta, Israel, Beglov, Dmitri, Ignatov, Mikhail, Kotelnikov, Sergey, Moal, Iain H., Ritchie, David W., Chauvot de Beauchêne, Isaure, Maigret, Bernard, Devignes, Marie-Dominique, Ruiz Echartea, Maria E., Barradas-Bautista, Didier, Cao, Zhen, Cavallo, Luigi, Oliva, Romina, Cao, Yue, Shen, Yang, Baek, Minkyung, Park, Taeyong, Woo, Hyeonuk, Seok, Chaok, Braitbard, Merav, Bitton, Lirane, Scheidman-Duhovny, Dina, Dapkūnas, Justas, Olechnovič, Kliment, Venclovas, Česlovas, Kundrotas, Petras J., Belkin, Saveliy, Chakravarty, Devlina, Badal, Varsha D., Vakser, Ilya A., Vreven, Thom, Vangaveti, Sweta, Borrman, Tyler, Weng, Zhiping, Guest, Johnathan D., Gowthaman, Ragul, Pierce, Brian G., Xu, Xianjin, Duan, Rui, Qiu, Liming, Hou, Jie, Ryan Merideth, Benjamin, Ma, Zhiwei, Cheng, Jianlin, Zou, Xiaoqin, Koukos, Panagiotis I., Roel-Touris, Jorge, Ambrosetti, Francesco, Geng, Cunliang, Schaarschmidt, Jörg, Trellet, Mikael E., Melquiond, Adrien S. J., Xue, Li, Jiménez-García, Brian, van Noort, Charlotte W., Honorato, Rodrigo V., Bonvin, Alexandre M. J. J., Wodak, Shoshana J., 0000-0003-3957-9470, 0000-0003-2759-2088, 0000-0003-0621-0925, 0000-0003-2098-5743, 0000-0001-7169-9398, 0000-0002-0294-3403, 0000-0002-4209-4565, 0000-0002-7787-8896, 0000-0002-3986-7686, 0000-0002-6163-6323, 0000-0003-4091-6614, 0000-0003-0464-4500, 0000-0002-4960-5487, 0000-0002-7035-3042, 0000-0002-1703-7796, 0000-0002-1419-9888, 0000-0002-0496-6107, 0000-0002-4215-0213, 0000-0002-5743-2934, 0000-0003-3413-806X, 0000-0002-3032-7966, 0000-0002-1409-8358, 0000-0001-7369-1322, 0000-0002-0701-6545, Unité de Glycobiologie Structurale et Fonctionnelle UMR 8576 (UGSF), Institut National de la Recherche Agronomique (INRA)-Université de Lille-Centre National de la Recherche Scientifique (CNRS), European Bioinformatics Institute [Hinxton] (EMBL-EBI), EMBL Heidelberg, The Francis Crick Institute [London], School of Geographical Sciences [Bristol], University of Bristol [Bristol], Biologie Computationnelle et Quantitative = Laboratory of Computational and Quantitative Biology (LCQB), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Institut de Biologie Paris Seine (IBPS), Sorbonne Université (SU)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), Institut Universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), JiangSu University, Chemical Research Support [Rehovot], Weizmann Institute of Science [Rehovot, Israël], University of Gdańsk (UG), Department of Environmental Analytics [Univ Gdańsk], Faculty of Chemistry [Univ Gdańsk], University of Gdańsk (UG)-University of Gdańsk (UG), Institute of Physics [Warsaw] (IFPAN), Polish Academy of Sciences (PAN), Department of Computer Science [Davis] (UC Davis), University of California [Davis] (UC Davis), University of California-University of California, Moscow Institute of Physics and Technology [Moscow] (MIPT), Huazhong University of Science and Technology [Wuhan] (HUST), Barcelona Supercomputing Center - Centro Nacional de Supercomputacion (BSC - CNS), Purdue University [West Lafayette], Kitasato University, Stony Brook University [SUNY] (SBU), State University of New York (SUNY), Department of Biomedical Engineering [Boston], Boston University [Boston] (BU), Computational Algorithms for Protein Structures and Interactions (CAPSID), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Complex Systems, Artificial Intelligence & Robotics (LORIA - AIS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Technische Universität Munchen - Université Technique de Munich [Munich, Allemagne] (TUM), King Abdullah University of Science and Technology (KAUST), University of Naples Federico II, Service des Recherches Métallurgiques Appliquées (SRMA), Département des Matériaux pour le Nucléaire (DMN), CEA-Direction des Energies (ex-Direction de l'Energie Nucléaire) (CEA-DES (ex-DEN)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-CEA-Direction des Energies (ex-Direction de l'Energie Nucléaire) (CEA-DES (ex-DEN)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Department of Chemistry, Seoul National University [Seoul] (SNU), The Hebrew University of Jerusalem (HUJ), Vilnius University [Vilnius], Department of Molecular Biosciences [Lawrence], University of Kansas [Lawrence] (KU), University of Kansas [Kansas City], University of Massachusetts Medical School [Worcester] (UMASS), University of Massachusetts System (UMASS), Program in Bioinformatics and Integrative Biology [Worcester], University of Massachusetts System (UMASS)-University of Massachusetts System (UMASS), University of Maryland [Baltimore], Beijing University of Technology, University of Missouri [Columbia] (Mizzou), University of Missouri System, Bijvoet Center for Biomolecular Research [Utrecht], Utrecht University [Utrecht], Dalton Cardiovascular Research Center [Columbia], University of Missouri System-University of Missouri System, Shandong University, Laboratoire d'Informatique pour la Mécanique et les Sciences de l'Ingénieur (LIMSI), Université Paris-Sud - Paris 11 (UP11)-Sorbonne Université - UFR d'Ingénierie (UFR 919), Sorbonne Université (SU)-Sorbonne Université (SU)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Université Paris Saclay (COmUE), University of California [Santa Cruz] (UCSC), University of California, The Hospital for sick children [Toronto] (SickKids), Unité de Glycobiologie Structurale et Fonctionnelle - UMR 8576 (UGSF), Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Institut National de la Recherche Agronomique (INRA), Institut des Hautes Etudes Scientifiques (IHES), IHES, The Francis Crick Institute, Institut de Biologie Paris Seine (IBPS), Institut National de la Santé et de la Recherche Médicale (INSERM)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Kuntzmann (LJK), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut National Polytechnique de Grenoble (INPG), Weizmann Institute of Science, University of Gdańsk, Department of Environmental Analytics [Gdańsk], Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Technische Universität München [München] (TUM), CEA-Direction de l'Energie Nucléaire (CEA-DEN), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-CEA-Direction de l'Energie Nucléaire (CEA-DEN), University of Missouri [Columbia], Université Paris-Sud - Paris 11 (UP11)-Université Paris-Saclay-Sorbonne Université - UFR d'Ingénierie (UFR 919), Sorbonne Université (SU)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Saclay (COmUE), Université de Lille, CNRS, Unité de Glycobiologie Structurale et Fonctionnelle UMR 8576 [UGSF], Agence Nationale de la Recherche (France), Cancer Research UK, European Commission, Medical Research Council (UK), National Institutes of Health (US), National Natural Science Foundation of China, National Research Foundation of Korea, National Science Foundation (US), Ministerio de Economía y Competitividad (España), Università degli Studi di Napoli PARTHENOPE, Wellcome Trust, Université de Lille-Centre National de la Recherche Scientifique (CNRS), Institut National de la Santé et de la Recherche Médicale (INSERM)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), Algorithms for Modeling and Simulating Nanosystems [2018-...] (NANO-D-POST [2018-2020]), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Department of Computer Science [Univ California Davis] (CS - UC Davis), University of California (UC)-University of California (UC), University of Naples Federico II = Università degli studi di Napoli Federico II, University of California [Santa Cruz] (UC Santa Cruz), University of California (UC), and Grudinin, Sergei

Subjects
Models, Molecular, Computer science, Protein Conformation, Protein complexes, Template‐based modeling, Oligomeric state, Biochemistry, Docking, protein-protein interaction, Structural Biology, Protein Interaction Mapping, Taverne, Blind prediction, Protein assemblies, Databases, Protein, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM], 0303 health sciences, oligomeric state, 030302 biochemistry & molecular biology, protein assemblies, computer.file_format, 3. Good health, CASP, docking, blind prediction, Protein‐protein interaction, CAPRI, proteincomplexes, Algorithms, Protein Binding, protein complexes, template-based modeling, Computational biology, Article, Protein–protein interaction, 03 medical and health sciences, protein‐protein interaction, template‐based modeling, Molecular Biology, 030304 developmental biology, Binding Sites, Computational Biology, Proteins, Protein Data Bank, Docking (molecular), Structural Homology, Protein, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], computer, Software
Abstract

We present the results for CAPRI Round 46, the third joint CASP‐CAPRI protein assembly prediction challenge. The Round comprised a total of 20 targets including 14 homo‐oligomers and 6 heterocomplexes. Eight of the homo‐oligomer targets and one heterodimer comprised proteins that could be readily modeled using templates from the Protein Data Bank, often available for the full assembly. The remaining 11 targets comprised 5 homodimers, 3 heterodimers, and two higher‐order assemblies. These were more difficult to model, as their prediction mainly involved “ab‐initio” docking of subunit models derived from distantly related templates. A total of ~30 CAPRI groups, including 9 automatic servers, submitted on average ~2000 models per target. About 17 groups participated in the CAPRI scoring rounds, offered for most targets, submitting ~170 models per target. The prediction performance, measured by the fraction of models of acceptable quality or higher submitted across all predictors groups, was very good to excellent for the nine easy targets. Poorer performance was achieved by predictors for the 11 difficult targets, with medium and high quality models submitted for only 3 of these targets. A similar performance “gap” was displayed by scorer groups, highlighting yet again the unmet challenge of modeling the conformational changes of the protein components that occur upon binding or that must be accounted for in template‐based modeling. Our analysis also indicates that residues in binding interfaces were less well predicted in this set of targets than in previous Rounds, providing useful insights for directions of future improvements., Agence Nationale de la Recherche, Grant/Award Number: ANR‐15‐CE11‐0029‐03; Cancer Research UK, Grant/Award Number: FC001003; H2020 European Institute of Innovation and Technology, Grant/Award Numbers: 675728, 777536, 823830; Lietuvos Mokslo Taryba, Grant/Award Number: S‐MIP‐17‐60; Medical Research Council, Grant/Award Number: FC001003; National Institutes of Health, Grant/Award Numbers: R01GM074255, R01GM123055, R35GM124952; National Natural Science Foundation of China, Grant/Award Number: 31670724; National Research Foundation of Korea, Grant/Award Number: 2016M3C4A7952630; National Science Foundation, Grant/Award Number: DBI1565107; Nederlandse Organisatie voor Wetenschappelijk Onderzoek, Grant/Award Number: 718.015.001; Spanish >Programma Estatal I+D+i>, Grant/Award Number: BIO2016‐79930‐R; University Parthenope, Grant/Award Number: Finanziamento per il Sostegno alla Ricerca Individ; Wellcome Trust, Grant/Award Number: FC001003

Published
2019
Full Text
View/download PDF

14. Active State of Sensory Rhodopsin II: Structural Determinants for Signal Transfer and Proton Pumping

Author

Martin Engelhard, Anastasia Reshetnyak, Valentin Gordeliy, Andrii Ishchenko, Sergei Grudinin, Valentin Borshchevskiy, Ekaterina Round, Ivan Gushchin, Georg Büldt, Moscow Institute of Physics and Technology [Moscow] (MIPT), Institut de biologie structurale (IBS - UMR 5075 ), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut de Recherche Interdisciplinaire de Grenoble (IRIG), Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Institute of Complex Systems (ICS), Forschungszentrum Jülich GmbH | Centre de recherche de Juliers, Helmholtz-Gemeinschaft = Helmholtz Association-Helmholtz-Gemeinschaft = Helmholtz Association, Institute of Crystallography [Aachen], Rheinisch-Westfälische Technische Hochschule Aachen University (RWTH), Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Kuntzmann (LJK), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS), Max Planck Institute of Molecular Physiology, Max-Planck-Gesellschaft, This work was supported by the program 'Chaires d'excellence' edition 2008 of ANR France, by a CEA(IBS)-HGF(FZJ) STC 5.1 specific agreement, and by a Marie Curie grant for the training and career development of researchers (FP7-PEOPLE- 2007-1-1-ITN, project SBMPs). This work was performed in the framework of Russian State contract numbers 02.740.11.0299, 02.740.11.5010, 974 (in the framework of activity 1.2.2), and P211 (in the framework of activity 1.3.2) of the Federal Target Program 'Scientific and academic research cadres of innovative Russia' for the years 2009- 2013., European Project: 211800,EC:FP7:PEOPLE,FP7-PEOPLE-2007-1-1-ITN,SBMPS(2008), Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut de Recherche Interdisciplinaire de Grenoble (IRIG), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Centre National de la Recherche Scientifique (CNRS), Rheinisch-Westfälische Technische Hochschule Aachen (RWTH), and Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)

Subjects
Models, Molecular, Protein Folding, Archaeal Proteins, Natronobacterium, [PHYS.PHYS.PHYS-BIO-PH]Physics [physics]/Physics [physics]/Biological Physics [physics.bio-ph], Crystallography, X-Ray, Models, Biological, Signal, 03 medical and health sciences, Structural Biology, Sensory Rhodopsins, membrane protein, Molecular Biology, 030304 developmental biology, G protein-coupled receptor, 0303 health sciences, Halobacteriaceae, [SDV.BBM.BS]Life Sciences [q-bio]/Biochemistry, Molecular Biology/Structural Biology [q-bio.BM], biology, Chemistry, 030302 biochemistry & molecular biology, Sensory rhodopsin II, Proton Pumps, Carotenoids, Transmembrane protein, Protein Structure, Tertiary, Transport protein, Crystallography, active state, Rhodopsin, Biophysics, biology.protein, Bacterial rhodopsins, Signal transduction, Crystallization, signaling, Signal Transduction, bacterial rhodopsins
Abstract

International audience; The molecular mechanism of transmembrane signal transduction is still a pertinent question in cellular biology. Generally, a receptor can transfer an external signal via its cytoplasmic surface as found for GPCRs like rhodopsin or via the membrane domain like it is utilized by sensory rhodopsin II (SRII) in complex with its transducer HtrII. In the absence of HtrII SRII functions as a proton pump. Here, we report on the crystal structure of the active state of SRII from Natronomonas pharaonis (NpSRII). The problem of a dramatic loss of the diffraction quality upon loading of the active state was overcome by growing better crystals and reducing the occupancy of the state. The determined conformational changes at the region comprising helices F and G are similar to those observed for the NpSRII-transducer complex but they are much more pronounced. Meaning of these differences for proton pumping ability and understanding of the signal transduction by NpSRII is discussed.

Published
2011
Full Text
View/download PDF

15. A comparison of neighbor search algorithms for large rigid molecules

Author

Stephane Redon, Svetlana Artemova, Sergei Grudinin, Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Kuntzmann (LJK), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS), and Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)

Subjects
rigid body molecular docking, bounding volume hierarchy, Computation, Monte Carlo method, Bounding volume hierarchy, Molecular Dynamics Simulation, 01 natural sciences, Diffusion, 03 medical and health sciences, Ribonucleases, Bacterial Proteins, Bounding overwatch, 0103 physical sciences, Animals, Horses, Enzyme Inhibitors, 030304 developmental biology, Mathematics, 0303 health sciences, 010304 chemical physics, Hierarchy (mathematics), Proteins, General Chemistry, Grid, Rigid body, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, neighbor list, Streptomyces, protein docking, hierarchy-based algorithm, Computational Mathematics, Bounding volume, Apoferritins, Capsid Proteins, Monte Carlo Method, Algorithm, rigid body molecular simulations, Algorithms, Bluetongue virus, Protein Binding
Abstract

International audience; Fast determination of neighboring atoms is an essential step in molecular dynamics simulations or Monte Carlo computations, and there exists a variety of algorithms to efficiently compute neighbor lists. However, most of these algorithms are general, and not specifically designed for a given type of application. As a result, although their average performance is satisfactory, they might be inappropriate in some specific application domains. In this article, we study the case of detecting neighbors between large rigid molecules, which has applications in, e.g., rigid body molecular docking, Monte Carlo simulations of molecular self-assembly or diffusion, and rigid body molecular dynamics simulations. More precisely, we compare the traditional grid-based algorithm to a series of hierarchy-based algorithms that use bounding volumes to rapidly eliminate large groups of irrelevant pairs of atoms during the neighbor search. We compare the performance of these algorithms based on several parameters: the size of the molecules, the average distance between them, the cutoff distance, as well as the type of bounding volume used in the culling hierarchy (AABB, OBB, wrapped, or layered spheres). We demonstrate that for relatively large systems (> 100,000 atoms) the algorithm based on the hierarchy of wrapped spheres shows the best results and the traditional grid-based algorithm gives the worst timings. For small systems, however, the grid-based algorithm and the one based on the wrapped sphere hierarchy are beneficial.

Published
2011
Full Text
View/download PDF

16. Practical modeling of molecular systems with symmetries

Author

Stephane Redon, Sergei Grudinin, Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Kuntzmann (LJK), Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF), and Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)

Subjects
Discrete mathematics, 0303 health sciences, Crystallographic point group, Binary tree, Symmetry operation, Structure (category theory), 020207 software engineering, 02 engineering and technology, General Chemistry, dihedral-angle subspace, Energy minimization, Topology, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, neighbor list, Symmetry (physics), 03 medical and health sciences, Computational Mathematics, torsion-angle subspace, 0202 electrical engineering, electronic engineering, information engineering, Molecular symmetry, geometry optimization, Representation (mathematics), symmetry, 030304 developmental biology, Mathematics
Abstract

International audience; A new method for efficient modeling of macromolecular systems with symmetries is presented. The method is based on a hierarchical representation of the molecular system and a novel fast binary tree-based neighbor list construction algorithm. The method supports all types of molecular symmetry, including crystallographic symmetry. Testing the proposed neighbor list construction algorithm on a number of different macromolecular systems containing up to about 200,000 of atoms shows that (1) the current binary tree-based neighbor list construction algorithm scales linearly in the number of atoms for the central subunit, and sublinearly for its replicas, (2) the overall computational overhead of the method for a system with symmetry with respect to the same system without symmetry scales linearly with the cutoff value and does not exceed 50% for all but one tested macromolecules at the cutoff distance of 12 Å. (3) the method may help produce optimized molecular structures that are much closer to experimentally determined structures when compared with the optimization without symmetry, (4) the method can be applied to models of macromolecules with still unknown detailed structure.

Published
2010
Full Text
View/download PDF

17. Continuous collision detection for adaptive simulation of articulated bodies

Author

Stephane Redon, Sujeong Kim, Young J. Kim, EWHA Womans University (EWHA), 3 dimensional interaction (I3D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF), Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Kuntzmann (LJK), Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), and Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)

Subjects
Computer science, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, Continuous collision detection, Motion (geometry), 020207 software engineering, 02 engineering and technology, Kinematics, Degrees of freedom (mechanics), [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Computer Graphics and Computer-Aided Design, Interval arithmetic, Computer graphics, Set (abstract data type), Tree (data structure), Control theory, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Collision detection, Computer Vision and Pattern Recognition, Articulated body dynamics, Algorithm, Adaptive dynamics, Software
Abstract

International audience; We perform continuous collision detection (CCD) for articulated bodies where motion is governed by an adaptive dynamics simulation. Our algorithm is based on a novel hierarchical set of transforms that represent the kinematics of an articulated body recursively, as described by an assembly tree. The performance of our CCD algorithm significantly improves as the number of active degrees of freedom in the simulation decreases.

Published
2008
Full Text
View/download PDF

18. View-dependent dynamics of articulated bodies

Author

Sujeong Kim, Stephane Redon, Young J. Kim, EWHA Womans University (EWHA), 3 dimensional interaction (I3D), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF), Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Kuntzmann (LJK), Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), and Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)

Subjects
0209 industrial biotechnology, level-of-detail, 020901 industrial engineering & automation, kinematics, 0202 electrical engineering, electronic engineering, information engineering, 020207 software engineering, dynamics, 02 engineering and technology, articulated bodies, simulation, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Computer Graphics and Computer-Aided Design, Software
Abstract

Special Issue: CASA'2008 Special Issue; International audience; We propose a method for view-dependent simplification of articulated-body dynamics, which enables an automatic trade-off between visual precision and computational efficiency. We begin by discussing the problem of simplifying the simulation based on visual criteria, and show that it raises a number of challenging questions. We then focus on articulated-body dynamics simulation, and propose a semi-predictive approach which relies on a combination of exact, a priori error metrics computations, and visibility estimations. We suggest several variants of semi-predictive metrics based on hierarchical data structures and the use of graphics hardware, and discuss their relative merits in terms of computational efficiency and precision. Finally, we present several benchmarks and demonstrate how our view-dependent articulated-body dynamics method allows an animator (or a physics engine) to finely tune the visual quality and obtain potentially significant speedups during interactive or off-line simulations.

Published
2008
Full Text
View/download PDF

19. Adaptive Physically Based Models in Computer Graphics

Author

Manteaux, Pierre-Luc, Wojtan, Chris, Narain, Rahul, Redon, Stéphane, Faure, François, Cani, Marie-Paule, Intuitive Modeling and Animation for Interactive Graphics & Narrative Environments (IMAGINE ), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Institute of Science and Technology [Austria] (IST Austria), Department of Electrical and Computer Engineering [Minneapolis] (ECE), University of Minnesota [Twin Cities] (UMN), University of Minnesota System-University of Minnesota System, Algorithms for Modeling and Simulation of Nanosystems (NANO-D), European Project: 291184,EC:FP7:ERC,ERC-2011-ADG_20110209,EXPRESSIVE(2012), and Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria)

Subjects
000 Computer science, knowledge & systems, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]
Abstract

International audience; One of the major challenges in physically-based modeling is making simulations efficient. Adaptive models provide an essential solution to these efficiency goals. These models are able to self-adapt in space and time, attempting to provide the best possible compromise between accuracy and speed. This survey reviews the adaptive solutions proposed so far in computer graphics. Models are classified according to the strategy they use for adaptation, from time-stepping and freezing techniques to geometric adaptivity in the form of structured grids, meshes, and particles. Applications range from fluids, through deformable bodies, to articulated solids.

Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results