Laurent Vuillon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Laurent Vuillon has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Clément Lagisquet
LAMA, Univ. Savoie Mont Blanc, CNRS, LAMA, 73376 Le Bourget du Lac, France
2 shared publications - Céline Labart
CNRS LAMA Univ. Savoie Mont Blanc France
2 shared publications - John Hjorth Ipsen
Center for Biomembrane Physics (MEMPHYS), Department of Physics, Chemistry and Pharmacy (FKF), University of Southern Denmark, Campusvej 55, 5230 Odense M, Denmark
2 shared publications - Julian C. Shillcock
Blue Brain Project and Laboratory of Molecular and Chemical Biology of Neurodegeneration, Ecole Polytechnique Fédérale de Lausanne, CH-1015 Lausanne, Switzerland
2 shared publications Jérémy Alexandre
Brain Mind Institute, École Polytechnique Fédérale de Lausanne, CH-1015 Lausanne, Switzerland
2 shared publications- Katarína Firdová2 shared publications
Latest Publications
- Open Access
- 7 April 2025
- Published by MDPI AG in Biomolecules
- Vol. 15 (4) , 541
Subtle Changes at the RBD/hACE2 Interface During SARS-CoV-2 Variant Evolution: A Molecular Dynamics Study
The SARS-CoV-2 Omicron variants show different behavior compared to the previous variants, especially with respect to the Delta variant, which promotes a lower morbidity despite being much more contagious. In this perspective, we performed molecular dynamics (MD) simulations of the different spike RBD/hACE2 complexes corresponding to the WT, Delta and four Omicron variants. Carrying out a comprehensive analysis of residue interactions within and between the two partners allowed us to draw the profile of each variant by using complementary methods (PairInt, hydrophobic potential, contact PCA). PairInt calculations highlighted the residues most involved in electrostatic interactions, which make a strong contribution to the binding with highly stable interactions between spike RBD and hACE2. Apolar contacts made a substantial and complementary contribution in Omicron with the detection of two hydrophobic patches. Contact networks and cross-correlation matrices were able to detect subtle changes at point mutations as the S375F mutation occurring in all Omicron variants, which is likely to confer an advantage in binding stability. This study brings new highlights on the dynamic binding of spike RBD to hACE2, which may explain the final persistence of Omicron over Delta.
- 7 April 2025
- Published by MDPI AG in Biomolecules
- Vol. 15 (4) , 541
Open AccessSubtle Changes at the RBD/hACE2 Interface During SARS-CoV-2 Variant Evolution: A Molecular Dynamics Study
The SARS-CoV-2 Omicron variants show different behavior compared to the previous variants, especially with respect to the Delta variant, which promotes a lower morbidity despite being much more contagious. In this perspective, we performed molecular dynamics (MD) simulations of the different spike RBD/hACE2 complexes corresponding to the WT, Delta and four Omicron variants. Carrying out a comprehensive analysis of residue interactions within and between the two partners allowed us to draw the profile of each variant by using complementary methods (PairInt, hydrophobic potential, contact PCA). PairInt calculations highlighted the residues most involved in electrostatic interactions, which make a strong contribution to the binding with highly stable interactions between spike RBD and hACE2. Apolar contacts made a substantial and complementary contribution in Omicron with the detection of two hydrophobic patches. Contact networks and cross-correlation matrices were able to detect subtle changes at point mutations as the S375F mutation occurring in all Omicron variants, which is likely to confer an advantage in binding stability. This study brings new highlights on the dynamic binding of spike RBD to hACE2, which may explain the final persistence of Omicron over Delta.
- Open Access
AUTOMATIC CLUSTERING OF INDUSTRIAL DATA WITH THE CONNECTED COMPONENTS
This paper proposes the use of techniques from the field of graph theory to automatically determine and cluster the same types of observations without prior knowledge on their number. The idea is to create a graph where observations are vertices and an edge between two observations exists if and only if one observation is in the nearest neighbourhood of another one. Connected components of the graphs can be then considered as groups of observations of the same type. The approach is particularly useful for multiclass anomaly detection in the context of Industry 4.0.
Open AccessAUTOMATIC CLUSTERING OF INDUSTRIAL DATA WITH THE CONNECTED COMPONENTS
This paper proposes the use of techniques from the field of graph theory to automatically determine and cluster the same types of observations without prior knowledge on their number. The idea is to create a graph where observations are vertices and an edge between two observations exists if and only if one observation is in the nearest neighbourhood of another one. Connected components of the graphs can be then considered as groups of observations of the same type. The approach is particularly useful for multiclass anomaly detection in the context of Industry 4.0.
- Open Access
AUTOMATIC CLUSTERING OF INDUSTRIAL DATA WITH THE CONNECTED COMPONENTS
This paper proposes the use of techniques from the field of graph theory to automatically determine and cluster the same types of observations without prior knowledge on their number. The idea is to create a graph where observations are vertices and an edge between two observations exists if and only if one observation is in the nearest neighbourhood of another one. Connected components of the graphs can be then considered as groups of observations of the same type. The approach is particularly useful for multiclass anomaly detection in the context of Industry 4.0.
Open AccessAUTOMATIC CLUSTERING OF INDUSTRIAL DATA WITH THE CONNECTED COMPONENTS
This paper proposes the use of techniques from the field of graph theory to automatically determine and cluster the same types of observations without prior knowledge on their number. The idea is to create a graph where observations are vertices and an edge between two observations exists if and only if one observation is in the nearest neighbourhood of another one. Connected components of the graphs can be then considered as groups of observations of the same type. The approach is particularly useful for multiclass anomaly detection in the context of Industry 4.0.
- Open Access
- 15 August 2023
- Published by Wiley in Ecology and Evolution
- Vol. 13 (8) , e10229
metanetwork: A R package dedicated to handling and representing trophic metanetworks
Trophic networks describe interactions between species at a given location and time. Due to environmental changes, anthropogenic perturbations or sampling effects, trophic networks may vary in space and time. The collection of network time series or networks in different sites thus constitutes a metanetwork. We present here the R packagemetanetwork, which will ease the representation, the exploration and analysis of trophic metanetwork data sets that are increasingly available. Our main methodological advance consists in suitable layout algorithm for trophic networks, which is based on trophic levels and dimension reduction in a graph diffusion kernel. In particular, it highlights relevant features of trophic networks (trophic levels, energetic channels). In addition, we developed tools to handle, compare visually and quantitatively and aggregate those networks. Static and dynamic visualisation functions have been developed to represent large networks. We apply our package workflow to several trophic network data sets.
- 15 August 2023
- Published by Wiley in Ecology and Evolution
- Vol. 13 (8) , e10229
Open Accessmetanetwork: A R package dedicated to handling and representing trophic metanetworks
Trophic networks describe interactions between species at a given location and time. Due to environmental changes, anthropogenic perturbations or sampling effects, trophic networks may vary in space and time. The collection of network time series or networks in different sites thus constitutes a metanetwork. We present here the R packagemetanetwork, which will ease the representation, the exploration and analysis of trophic metanetwork data sets that are increasingly available. Our main methodological advance consists in suitable layout algorithm for trophic networks, which is based on trophic levels and dimension reduction in a graph diffusion kernel. In particular, it highlights relevant features of trophic networks (trophic levels, energetic channels). In addition, we developed tools to handle, compare visually and quantitatively and aggregate those networks. Static and dynamic visualisation functions have been developed to represent large networks. We apply our package workflow to several trophic network data sets.
- Open Access
- 25 August 2022
- Published by Royal Society of Chemistry (RSC) in Soft Matter
- Vol. 18 (35) , 6674-6693
Model biomolecular condensates have heterogeneous structure quantitatively dependent on the interaction profile of their constituent macromolecules
Model biomolecular condensates have heterogeneous material properties that are tuned by the number and distribution of their constituent proteins’ sticky binding sites.
- 25 August 2022
- Published by Royal Society of Chemistry (RSC) in Soft Matter
- Vol. 18 (35) , 6674-6693
Open AccessModel biomolecular condensates have heterogeneous structure quantitatively dependent on the interaction profile of their constituent macromolecules
Model biomolecular condensates have heterogeneous material properties that are tuned by the number and distribution of their constituent proteins’ sticky binding sites.
- Open Access
Model biomolecular condensates have heterogeneous structure quantitatively dependent on the interaction profile of their constituent macromolecules
Biomolecular condensates play numerous roles in cells by selectively concentrating client proteins while excluding others. These functions are likely to be sensitive to the spatial organization of the scaffold proteins forming the condensate. We use coarse-grained molecular simulations to show that model intrinsically-disordered proteins phase separate into a heterogeneous, structured fluid characterized by a well-defined length scale. The proteins are modelled as semi-flexible polymers with punctate, multifunctional binding sites in good solvent conditions. Their dense phase is highly solvated with a spatial structure that is more sensitive to the separation of the binding sites than their affinity. We introduce graph theoretic measures to show that the proteins are heterogeneously distributed throughout the dense phase, an effect that increases with increasing binding site number, and exhibit multi-timescale dynamics. The simulations predict that the structure of the dense phase is modulated by the location and affinity of binding sites distant from the termini of the proteins, while sites near the termini more strongly affect its phase behaviour. The relations uncovered between the arrangement of weak interaction sites on disordered proteins and the material properties of their dense phase can be experimentally tested to give insight into the biophysical properties and rational design of biomolecular condensates.
Open AccessModel biomolecular condensates have heterogeneous structure quantitatively dependent on the interaction profile of their constituent macromolecules
Biomolecular condensates play numerous roles in cells by selectively concentrating client proteins while excluding others. These functions are likely to be sensitive to the spatial organization of the scaffold proteins forming the condensate. We use coarse-grained molecular simulations to show that model intrinsically-disordered proteins phase separate into a heterogeneous, structured fluid characterized by a well-defined length scale. The proteins are modelled as semi-flexible polymers with punctate, multifunctional binding sites in good solvent conditions. Their dense phase is highly solvated with a spatial structure that is more sensitive to the separation of the binding sites than their affinity. We introduce graph theoretic measures to show that the proteins are heterogeneously distributed throughout the dense phase, an effect that increases with increasing binding site number, and exhibit multi-timescale dynamics. The simulations predict that the structure of the dense phase is modulated by the location and affinity of binding sites distant from the termini of the proteins, while sites near the termini more strongly affect its phase behaviour. The relations uncovered between the arrangement of weak interaction sites on disordered proteins and the material properties of their dense phase can be experimentally tested to give insight into the biophysical properties and rational design of biomolecular condensates.
- Open Access
- 12 May 2021
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 44 (4) , 2423-2442
Further steps on the reconstruction of convex polyominoes from orthogonal projections
A remarkable family of discrete sets which has recently attracted the attention of the discrete geometry community is the family of convex polyominoes, that are the discrete counterpart of Euclidean convex sets, and combine the constraints of convexity and connectedness. In this paper we study the problem of their reconstruction from orthogonal projections, relying on the approach defined by Barcucci et al. (Theor Comput Sci 155(2):321–347, 1996). In particular, during the reconstruction process it may be necessary to expand a convex subset of the interior part of the polyomino, say the polyomino kernel, by adding points at specific positions of its contour, without losing its convexity. To reach this goal we consider convexity in terms of certain combinatorial properties of the boundary word encoding the polyomino. So, we first show some conditions that allow us to extend the kernel maintaining the convexity. Then, we provide examples where the addition of one or two points causes a loss of convexity, which can be restored by adding other points, whose number and positions cannot be determined a priori.
- 12 May 2021
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 44 (4) , 2423-2442
Open AccessFurther steps on the reconstruction of convex polyominoes from orthogonal projections
A remarkable family of discrete sets which has recently attracted the attention of the discrete geometry community is the family of convex polyominoes, that are the discrete counterpart of Euclidean convex sets, and combine the constraints of convexity and connectedness. In this paper we study the problem of their reconstruction from orthogonal projections, relying on the approach defined by Barcucci et al. (Theor Comput Sci 155(2):321–347, 1996). In particular, during the reconstruction process it may be necessary to expand a convex subset of the interior part of the polyomino, say the polyomino kernel, by adding points at specific positions of its contour, without losing its convexity. To reach this goal we consider convexity in terms of certain combinatorial properties of the boundary word encoding the polyomino. So, we first show some conditions that allow us to extend the kernel maintaining the convexity. Then, we provide examples where the addition of one or two points causes a loss of convexity, which can be restored by adding other points, whose number and positions cannot be determined a priori.
- 15 December 2020
- Published by Springer Nature
Topology Results on Adjacent Amino Acid Networks of Oligomeric Proteins
- 15 December 2020
- Published by Springer Nature
Topology Results on Adjacent Amino Acid Networks of Oligomeric Proteins
- Open Access
- 20 December 2017
- Published by Walter de Gruyter GmbH in Uniform distribution theory
- Vol. 12 (2) , 25-35
Palindromic Closures and Thue-Morse Substitution for Markoff Numbers
We state a new formula to compute the Markoff numbers using iterated palindromic closure and the Thue-Morse substitution. The main theorem shows that for each Markoff number m, there exists a word v ∈ {a, b}∗ such that m − 2 is equal to the length of the iterated palindromic closure of the iterated antipalindromic closure of the word av. This construction gives a new recursive construction of the Markoff numbers by the lengths of the words involved in the palindromic closure. This construction interpolates between the Fibonacci numbers and the Pell numbers.
- 20 December 2017
- Published by Walter de Gruyter GmbH in Uniform distribution theory
- Vol. 12 (2) , 25-35
Open AccessPalindromic Closures and Thue-Morse Substitution for Markoff Numbers
We state a new formula to compute the Markoff numbers using iterated palindromic closure and the Thue-Morse substitution. The main theorem shows that for each Markoff number m, there exists a word v ∈ {a, b}∗ such that m − 2 is equal to the length of the iterated palindromic closure of the iterated antipalindromic closure of the word av. This construction gives a new recursive construction of the Markoff numbers by the lengths of the words involved in the palindromic closure. This construction interpolates between the Fibonacci numbers and the Pell numbers.
- 13 September 2016
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 146 (2) , 197-209
Tiling the Space by Polycube Analogues of Fedorov’s Polyhedra
We investigate minimal polycubes in terms of volume that tile the ℝ3 space like the Fedorov’s polyhedra. In fact the 5 Fedorov’s polyhedra are convex polyhedra that tile the space by translation and we construct geometrical discrete objects formed by
- 13 September 2016
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 146 (2) , 197-209
Tiling the Space by Polycube Analogues of Fedorov’s Polyhedra
We investigate minimal polycubes in terms of volume that tile the ℝ3 space like the Fedorov’s polyhedra. In fact the 5 Fedorov’s polyhedra are convex polyhedra that tile the space by translation and we construct geometrical discrete objects formed by