Fredrik Sjunnesson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Fredrik Sjunnesson has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Anders Irbäck
Lund University
4 shared publications - Stefan Wallin
Department of Astronomy and Theoretical Physics, Computational Biology and Biological Physics Group, Lund University, Lund, Sweden
2 shared publications Björn Samuelsson
Complex Systems Division Department of Theoretical Physics Lund University Sölvegatan 14A SE-223 62 Lund Sweden
1 shared publication- Giorgio Favrin
Cambridge Systems Biology Centre, University of Cambridge, Cambridge, United Kingdom
1 shared publication S. Bilke
Complex Systems Division Department of Theoretical Physics University of Lund Sölvegatan 14A S-223 62 Lund Sweden
1 shared publication- Sven Bilke
Complex Systems Division, Department of Theoretical Physics, University of Lund, Sölvegatan 14A, S-223 62 Lund, Sweden
1 shared publication
Latest Publications
- Open Access
Folding thermodynamics of three beta-sheet peptides: A model study
We study the folding thermodynamics of a beta-hairpin and two three-stranded beta-sheet peptides using a simplified sequence-based all-atom model, in which folding is driven mainly by backbone hydrogen bonding and effective hydrophobic attraction. The native populations obtained for these three sequences are in good agreement with experimental data. We also show that the apparent native population depends on which observable is studied; the hydrophobicity energy and the number of native hydrogen bonds give different results. The magnitude of this dependence matches well with the results obtained in two different experiments on the beta-hairpin.
Open AccessFolding thermodynamics of three beta-sheet peptides: A model study
We study the folding thermodynamics of a beta-hairpin and two three-stranded beta-sheet peptides using a simplified sequence-based all-atom model, in which folding is driven mainly by backbone hydrogen bonding and effective hydrophobic attraction. The native populations obtained for these three sequences are in good agreement with experimental data. We also show that the apparent native population depends on which observable is studied; the hydrophobicity energy and the number of native hydrogen bonds give different results. The magnitude of this dependence matches well with the results obtained in two different experiments on the beta-hairpin.
- Open Access
Thermodynamics of alpha- and beta-structure formation in proteins
An atomic protein model with a minimalistic potential is developed and then tested on an alpha-helix and a beta-hairpin, using exactly the same parameters for both peptides. We find that melting curves for these sequences to a good approximation can be described by a simple two-state model, with parameters that are in reasonable quantitative agreement with experimental data. Despite the apparent two-state character of the melting curves, the energy distributions are found to lack a clear bimodal shape, which is discussed in some detail. We also perform a Monte Carlo-based kinetic study and find, in accord with experimental data, that the alpha-helix forms faster than the beta-hairpin.
Open AccessThermodynamics of alpha- and beta-structure formation in proteins
An atomic protein model with a minimalistic potential is developed and then tested on an alpha-helix and a beta-hairpin, using exactly the same parameters for both peptides. We find that melting curves for these sequences to a good approximation can be described by a simple two-state model, with parameters that are in reasonable quantitative agreement with experimental data. Despite the apparent two-state character of the melting curves, the energy distributions are found to lack a clear bimodal shape, which is discussed in some detail. We also perform a Monte Carlo-based kinetic study and find, in accord with experimental data, that the alpha-helix forms faster than the beta-hairpin.
- 20 December 2001
- Published by American Physical Society (APS) in Physical Review E
- Vol. 65 (1) , 016129
Stability of the Kauffman model
Random Boolean networks, the Kauffman model, are revisited by means of a novel decimation algorithm, which removes variables that cannot be relevant to the asymptotic dynamics of the system. The major part of the removed variables have the same fixed state in all limit cycles. These variables are denoted as the stable core of the network and their number grows approximately linearly with N, the number of variables in the original network. The sensitivity of the attractors to perturbations is investigated. We find that reduced networks lack the well-known insensitivity observed in full Kauffman networks. We conclude that, somewhat counterintuitive, this remarkable property of full Kauffman networks is generated by the dynamics of their stable core. The decimation method is also used to simulate large critical Kauffman networks. For networks up to we perform full enumeration studies. Strong evidence is provided that the number of limit cycles grows linearly with N. This result is in sharp contrast to the often cited behavior.- 20 December 2001
- Published by American Physical Society (APS) in Physical Review E
- Vol. 65 (1) , 016129
Stability of the Kauffman model
Random Boolean networks, the Kauffman model, are revisited by means of a novel decimation algorithm, which removes variables that cannot be relevant to the asymptotic dynamics of the system. The major part of the removed variables have the same fixed state in all limit cycles. These variables are denoted as the stable core of the network and their number grows approximately linearly with N, the number of variables in the original network. The sensitivity of the attractors to perturbations is investigated. We find that reduced networks lack the well-known insensitivity observed in full Kauffman networks. We conclude that, somewhat counterintuitive, this remarkable property of full Kauffman networks is generated by the dynamics of their stable core. The decimation method is also used to simulate large critical Kauffman networks. For networks up to we perform full enumeration studies. Strong evidence is provided that the number of limit cycles grows linearly with N. This result is in sharp contrast to the often cited behavior.- Open Access
Stability of the Kauffman Model
Random Boolean networks, the Kauffman model, are revisited by means of a novel decimation algorithm, which reduces the networks to their dynamical cores. The average size of the removed part, the stable core, grows approximately linearly with N, the number of nodes in the original networks. We show that this can be understood as the percolation of the stability signal in the network. The stability of the dynamical core is investigated and it is shown that this core lacks the well known stability observed in full Kauffman networks. We conclude that, somewhat counter-intuitive, the remarkable stability of Kauffman networks is generated by the dynamics of the stable core. The decimation method is also used to simulate large critical Kauffman networks. For networks up to N=32 we perform full enumeration studies. Strong evidence is provided for that the number of limit cycles grows linearly with N. This result is in sharp contrast to the often cited $\sqrt{N}$ behavior.Open AccessStability of the Kauffman Model
Random Boolean networks, the Kauffman model, are revisited by means of a novel decimation algorithm, which reduces the networks to their dynamical cores. The average size of the removed part, the stable core, grows approximately linearly with N, the number of nodes in the original networks. We show that this can be understood as the percolation of the stability signal in the network. The stability of the dynamical core is investigated and it is shown that this core lacks the well known stability observed in full Kauffman networks. We conclude that, somewhat counter-intuitive, the remarkable stability of Kauffman networks is generated by the dynamics of the stable core. The decimation method is also used to simulate large critical Kauffman networks. For networks up to N=32 we perform full enumeration studies. Strong evidence is provided for that the number of limit cycles grows linearly with N. This result is in sharp contrast to the often cited $\sqrt{N}$ behavior. - Open Access
Monte Carlo Update for Chain Molecules: Biased Gaussian Steps in Torsional Space
We develop a new elementary move for simulations of polymer chains in torsion angle space. The method is flexible and easy to implement. Tentative updates are drawn from a (conformation-dependent) Gaussian distribution that favors approximately local deformations of the chain. The degree of bias is controlled by a parameter b. The method is tested on a reduced model protein with 54 amino acids and the Ramachandran torsion angles as its only degrees of freedom, for different b. Without excessive fine tuning, we find that the effective step size can be increased by a factor of three compared to the unbiased b=0 case. The method may be useful for kinetic studies, too.
Open AccessMonte Carlo Update for Chain Molecules: Biased Gaussian Steps in Torsional Space
We develop a new elementary move for simulations of polymer chains in torsion angle space. The method is flexible and easy to implement. Tentative updates are drawn from a (conformation-dependent) Gaussian distribution that favors approximately local deformations of the chain. The degree of bias is controlled by a parameter b. The method is tested on a reduced model protein with 54 amino acids and the Ramachandran torsion angles as its only degrees of freedom, for different b. Without excessive fine tuning, we find that the effective step size can be increased by a factor of three compared to the unbiased b=0 case. The method may be useful for kinetic studies, too.
- Open Access
Three-helix-bundle Protein in a Ramachandran Model
We study the thermodynamic behavior of a model protein with 54 amino acids that forms a three-helix bundle in its native state. The model contains three types of amino acids and five to six atoms per amino acid and has the Ramachandran torsional angles $\phi_i$, $\psi_i$ as its degrees of freedom. The force field is based on hydrogen bonds and effective hydrophobicity forces. For a suitable choice of the relative strength of these interactions, we find that the three-helix-bundle protein undergoes an abrupt folding transition from an expanded state to the native state. Also shown is that the corresponding one- and two-helix segments are less stable than the three-helix sequence.Open AccessThree-helix-bundle Protein in a Ramachandran Model
We study the thermodynamic behavior of a model protein with 54 amino acids that forms a three-helix bundle in its native state. The model contains three types of amino acids and five to six atoms per amino acid and has the Ramachandran torsional angles $\phi_i$, $\psi_i$ as its degrees of freedom. The force field is based on hydrogen bonds and effective hydrophobicity forces. For a suitable choice of the relative strength of these interactions, we find that the three-helix-bundle protein undergoes an abrupt folding transition from an expanded state to the native state. Also shown is that the corresponding one- and two-helix segments are less stable than the three-helix sequence.