New Research In
Physical Sciences
Social Sciences
Featured Portals
Articles by Topic
Biological Sciences
Featured Portals
Articles by Topic
 Agricultural Sciences
 Anthropology
 Applied Biological Sciences
 Biochemistry
 Biophysics and Computational Biology
 Cell Biology
 Developmental Biology
 Ecology
 Environmental Sciences
 Evolution
 Genetics
 Immunology and Inflammation
 Medical Sciences
 Microbiology
 Neuroscience
 Pharmacology
 Physiology
 Plant Biology
 Population Biology
 Psychological and Cognitive Sciences
 Sustainability Science
 Systems Biology
Constructing the equilibrium ensemble of folding pathways from short offequilibrium simulations

Edited by Kenneth A. Dill, University of California, San Francisco, CA, and approved September 16, 2009 (received for review May 20, 2009)
Related Articles
 How to mark off paths on the protein energy landscape Nov 10, 2009
Abstract
Characterizing the equilibrium ensemble of folding pathways, including their relative probability, is one of the major challenges in protein folding theory today. Although this information is in principle accessible via allatom molecular dynamics simulations, it is difficult to compute in practice because protein folding is a rare event and the affordable simulation length is typically not sufficient to observe an appreciable number of folding events, unless very simplified protein models are used. Here we present an approach that allows for the reconstruction of the full ensemble of folding pathways from simulations that are much shorter than the folding time. This approach can be applied to allatom protein simulations in explicit solvent. It does not use a predefined reaction coordinate but is based on partitioning the state space into small conformational states and constructing a Markov model between them. A theory is presented that allows for the extraction of the full ensemble of transition pathways from the unfolded to the folded configurations. The approach is applied to the folding of a PinWW domain in explicit solvent where the folding time is two orders of magnitude larger than the length of individual simulations. The results are in good agreement with kinetic experimental data and give detailed insights about the nature of the folding process which is shown to be surprisingly complex and parallel. The analysis reveals the existence of misfolded trap states outside the network of efficient folding intermediates that significantly reduce the folding speed.
Discovering the mechanism by which proteins fold into their native 3D structure remains an intriguing problem (1, 2). Essential questions are: How does an ensemble of denatured molecules find the same native structure, starting from different conformations? Are there particular sequences in which the structural elements of a protein are formed (3–5)? Are there multiple parallel routes by which protein structure formation can proceed (6, 7)?
Full answers to these questions require one to characterize the ensemble of folding pathways, including their relative probabilities. In principle, this detailed information is accessible via molecular dynamics (MD) simulations which, when used in concert with experimental evidence, are becoming an increasingly accepted tool to understanding structural details that are not easily accessible via the experimental observables (8). MD simulations with atomistic models of proteins have been used to study the dynamics of small proteins with folding times in the microsecond range (9–13). However, even though MD simulations make the full spatiotemporal detail accessible to observation, the characterization of the pathway ensemble is computationally difficult: A bruteforce approach would start simulations from an equilibrium of unfolded structures, say A, and simulate until they relax into a set of folded state B. The analysis would then only be comprised of those trajectory segments that leave A and relax to B without returning to A (Fig. 1). Such a procedure is generally unpractical, since protein folding is a rare event and often the affordable simulation length is insufficient in order to observe an appreciable number of folding events, unless very simplified simulation models are used. On the other hand, sampling techniques that enhance the sampling of predefined reaction coordinates may work well for systems with simple transition pathways but are not likely to produce unbiased results in protein folding, which likely involves many statistically relevant but a priori unknown transition states.
It is thus desirable to develop a method that can reconstruct the equilibrium ensemble of folding pathways from simulations that are not driven and yet are much shorter than the folding time. Ideally, these simulations sample different parts of conformation space and thus provide information on different subsegments of the folding process. The reconstruction of folding pathways needs to be done in a statistically correct manner, so as to avoid a bias toward fast folding pathways (14). Masterequation or Markov models of the molecular kinetics are a natural approach toward this goal, as they decompose the macroscopic and possibly slow transition (folding) into a network of faster transitions between individual conformational states (15–17). It has been shown for small model systems that Markov models permit the combination of information from short simulations and extract the correct longtime kinetics (18, 19). Markov models of small proteins have also been reported to reproduce experimental folding time scales (20). In addition, Markov models have the advantage over many other analysis methods that they do not require the definition of a reaction coordinate that may provide a biased or oversimplified view on the kinetics (21).
The present paper proposes an approach for computing the equilibrium ensemble of folding pathways from short simulations started out of equilibrium based on (i) combining the information from the short trajectories into a joint Markov model, and (ii) a theory of folding pathways that is based on the mathematical framework of transitionpath theory (22, 23) for computing the ensemble of folding pathways along with their relative probabilities.
In order to illustrate the approach for computing folding pathways, consider the model potential in Fig. 2A, which is a funnellike energy landscape with the “unfolded” highenergy states A1, A2, A3, “intermediates” I1,I2, and the “native” state B. A discrete state space was defined by a 50 × 50 grid lattice and the dynamics are given by a Markov jump process between neighboring grid cells (see SI Appendix for details). The main ingredient for computing the transition pathways from A to B is the committor probability, also known as probability of folding, p_{fold} (see Fig. 2 B) (22, 24, 25). For every state i, the committor gives the probability to fold from that state (toward B), instead of unfolding (toward A). Based on the Markov model and the committor, transitionpath theory allows the “folding flux” to be computed, which represents the net flux of folding trajectories leaving the unfolded and entering the folded set (see Fig. 2A) and provides the probability of any realization of the folding pathway. This folding flux allows many quantitative properties of interest to be to computed, such as the probability that one structural element forms before the other.
Although the full information of all possible folding pathways is contained in the folding flux, this information is too detailed to provide a simple illustration of the folding mechanism. Therefore, a flux lumping procedure is derived, which allows one to coarsegrain the folding flux into a net flux between macroscopic conformations (Fig. 2C), showing the essential network of folding pathways. This network can be decomposed into individual pathways, if desired (Fig. 2D). The relative probability of each folding pathway is immediately given by the magnitude of the flux along it.
The PinWW domain is required for the regulation of many cellular processes and has been a model system for studying protein folding (26–28). PinWW is comprised of a twisted, triplestranded, antiparallel βsheet containing two Trp residues. Extensive thermodynamic and kinetic experiments of the PinWW–domain folding process have been conducted (26). These experiments show that a single time scale on the 10μs order dominates the slowrelaxation kinetics, thus PinWW is an apparent twostate folder. Recent measurements, however, find that some mutants have more than one time scale, indicating that additional relaxation processes between local energy minima appear when examining the kinetics in detail (29).
The approach to computing folding pathways is applied to a set of 180 explicit solvent simulations of PinWW, whose individual length is two orders of magnitude shorter than the slowest time scales in the system. The Markov model allows the probability of the folded state and the kinetic relaxation to be calculated, and these results are in good agreement with experiment. It is demonstrated that the Markov model is an approximately unbiased model for the dynamics on long time scales. Remarkably, the method allows the folding pathways to be reconstructed despite the fact that no contiguous pathway from the unfolded to the folded state is observed in a single simulation. The results provide detailed insights into the surprisingly complex and parallel nature of the folding process and reveal the existence of misregistered trap states that slow down the folding.
Theory
Markovian Dynamics and Transition Probability Matrix.
In order to combine the information contained in many short MD trajectories, a model for the dynamics between the various molecular conformational states is needed. Assume that the state space of the molecule is discretized into a set of S = {1,…,m} conformational states (typically a few thousand) and that then a m × m transition probability matrix T(τ) is computed, where each element T_{ij} measures the probability of going from state i to state j within time τ, by
We require that T(τ) is ergodic, i.e., any state can be reached from any other state within a finite time. Then, T(τ) has a single eigenvector with eigenvalue 1. When normalizing this eigenvector, it gives the stationary probability π. For equilibrium MD, π is the Boltzmann distribution, and the detailed balance condition holds: π_{i}T_{ij} = π_{j}T_{ji}.
When the vector p(t) denotes the probability of the system to be in any of its m states at time t, the probabilities at time t+τ are given by p(t+τ) = p(t)T(τ). In order for the Markov model to correctly represent the longtime MD, it must be tested whether T(nτ) ≈ T^{n}(τ) holds, thus allowing p(t + nτ) = p(t)T^{n}(τ) to be computed (see SI Appendix for details).
TransitionPath Theory.
In order to compute transition pathways, two subsets of the state space, A and B, are defined to specify the transition process one wants to investigate. Here, A and B correspond to the nearly unstructured unfolded and the native set, respectively. All remaining states are unassigned intermediate states I. What is the probability distribution of the trajectories leaving A and continuing on to B? That is, what is the typical sequence of I states used along the transition pathways?
The essential ingredient required to compute the statistics of transition pathways is the committor probability, q_{i}^{+}, defined as the probability, when being at state i, that the system will reach the set B next rather than A (22, 24, 25). In the current context, it is the probability of folding, often denoted as p_{fold} (24). By definition, q_{i}^{+} = 0 for all i in A and q_{i}^{+} = 1 for all i in B. The committor probability for all intermediate states i can be computed by solving the following system of equations: The committor gradually increases from state A to state B (see Fig. 2B for illustration).
Furthermore, the backwardcommittor probability q_{i}^{−} is the probability, when being at state i, that the system was in set A previously, rather than in B. For a molecule in equilibrium, this probability is simply q^{−} = 1 − q^{+}.
The transition probability T_{ij} contains contributions from all trajectories, including trajectories that leave A and return to A before hitting B, or B → A trajectories. In order to evaluate the statistics of A → B trajectories, only a fraction of the transitions which come from A and go on to B is relevant, i.e. q_{i}^{−}T_{ij}q_{j}^{+}. The effective flux f_{ij} is defined as the probability flux along edge i,j, contributing to the transition A → B: The effective flux still contains unnecessary detours, such as recrossings A → … → i → j → i → j → … → B. Thus, for any pair i,j in the intermediate set of states, both f_{ij} and f_{ji} are positive. In order to only consider the net flux of A → B trajectories, f_{ij}^{+}, one computes f_{ij}^{+} defines the folding flux and is a network of fluxes leaving states A and entering states B (see Fig. 2D for an illustration). An equivalent expression for the folding flux has recently been proposed in ref. 30. This network is fluxconserving, i.e. the total amount of flux F that leaves states A will enter B whereas for every intermediate state i, input flux equals output flux.
Although we will be mostly interested in the relative weight of different pathways within the folding flux, note that the absolute value of the flux still has a physical meaning. In particular, the expected number of observed A → B transitions per time unit τ is given by the total folding flux Another quantity of interest is the rate of the reaction A → B, k_{AB}: Note that all states that trap the trajectory for some time will reduce k_{AB}. The effect of these traps is properly accounted for in the folding flux, even if they do not contribute to productive pathways. See the SI Appendix for more general transition path theory equations and derivations.
CoarseGraining of the Folding Flux.
Because the number of m conformational states used to construct a Markov model is typically large, it is convenient for illustration purposes to compute the net flux of A → B trajectories among only a few coarse sets of conformations. Let us consider the coarse partition of state space S = {C_{1},C_{2},…,C_{n}} with n ≪ m, defined such that the boundaries of A, B, and I are preserved, i.e. A and B are either identical to individual C_{i} or to a collection of multiple C_{i}. Then we define the coarsegrained folding flux: The exact way of defining the sets C_{i} is arbitrary and depends on which features the user is interested in. For example, C_{i} might be chosen so as to distinguish between different secondary or tertiary structures, or they might be defined so as to separate the free energy minima (metastable states) of the system (15).
Decomposition into Individual Pathways.
It may be convenient to decompose the folding flux or the coarsegrained folding flux into individual pathways P_{i} that connect A and B. For molecules in equilibrium, the flux can always be fully decomposed into a sum of circlefree A → B pathways. Note that this decomposition is generally nonunique, i.e. there may be many ways a given flux can be decomposed into individual pathways. However, any such decomposition has the property that the statistical questions about the order of events can computed from this set of pathways, which makes them a useful analysis tool. The simplest decomposition is obtained by starting in A and just selecting successor states in a random order until B is found, then determining the minimal net flux f along that chosen pathway and removing that pathway from the network by subtracting f from every f_{ij}^{+} along the pathway. A particularly interesting way of decomposing the network is to identify the strongest pathways first (see SI Appendix).
The decomposition generates a set of pathways, P_{i}, along with their fluxes, f_{i}. The flux f_{i} provides the relative probability with which pathway i is used when considering the set of pathways P_{i} as possible options:
Order of Structural Events.
The characterization of protein folding mechanisms is usually made in terms of describing an order of events. For example, in PinWW, is hairpin 1 formed before hairpin 2? For each individual pathway P_{i}, this question can be answered. Let E be any event whose probability p(E) is to be evaluated, such as E = “hairpin 1 forms before hairpin 2”, then this probability can be computed by decomposing the folding flux into pathways P_{i} with individual fluxes f_{i} and probabilities p_{i}, and then where δ_{i}(E) = 1 if E occurs in pathway P_{i} and 0 otherwise. Eq. 4 can only provide the correct probability if the discretization into conformational states used is fine enough, such that the event E can be distinguished from the alternative events. In the example above, the conformational states need to be fine enough such that there is no state containing states where hairpin 1 is both formed and not formed (and likewise for hairpin 2). As p(E) is a welldefined property of a given system, it is independent of the way by which the folding flux is decomposed into pathways.
Application to the Folding of PinWW
In order to illustrate the utility of our approach for studying folding mechanisms, the folding dynamics of the PinWW domain (26) is studied here. A total of 180 MD simulations were started, 100 from nearnative conformations and 80 from different denatured conformations and run for 115 ns each at a temperature of 360 K. The simulations were conducted with the GROMACS program (31) by using explicit SPC solvent, the GROMOS96 force field (32), and the reaction field method for computing nonbonded forces. The simulation setup is described in detail in the SI Appendix. The simulated structures were aligned onto the native structure and then clustered finely into 1,734 kinetically connected and wellpopulated clusters. A transition matrix T(τ) was constructed by counting transitions between these clusters at a lag time of τ = 2 ns (see Theory). It was verified that T(τ) is a good model for the longtime kinetics (details on the Markov model construction and validation are given in the SI Appendix). All properties computed from the Markov model are associated with statistical uncertainty resulting from the fact that only a finite amount of simulation data has been used to construct the model. These uncertainties are computed by using a Bayesian inference method described in ref. 33; the details are given in the SI Appendix. The Markov model can further be validated by comparison with kinetic experimental data recorded at the simulation temperature. The kinetic relaxation curve obtained from tryptophan (Trp) fluorescence temperaturejump experiments (26) can be compared with the relaxation from an offequilibrium distribution of states (mimicking the situation before the Tjump) into the new equilibrium distribution monitored by a kinetic relaxation curve that is defined via the Trp solventaccessible surface area (see SI Appendix for details). In both the experiment and the model, this kinetic relaxation has a fast, nonexponential decay from 1 to about 0.4, presumably resulting from fast relaxation processes that affect the Trp configurations, followed by a slow, singleexponential decay with a timescale of 26 μs in the model (confidence intervals 8–78 μs) whereas a relaxation time of 13.2 μs was computed from the experimentally determined kinetic parameters given in ref. 26.
In order to study the folding mechanism, a folded set B was defined to be the set of clusters with average backbone root mean square difference to the Xray structure of less than 0.3 nm. The denatured set A was defined to be the set of all clusters with little βstructure (having a mean of <3 hbonds in hairpin 1, which has 6 hbonds in the native state, and <1 hbonds in hairpin 2, which has 3 hbonds in the native state). Based on these definitions and the transition matrix T(τ) between the 1,734 clusters, the committor probabilities and the folding flux were computed as described in Theory.
In order to obtain a view of the sequence of events that is unbiased by defining reaction coordinates, the folding pathways must be considered individually. Therefore, the folding flux was decomposed into individual pathways (see Theory) and for each of them the times when hairpin 1 or 2 forms and remains stable were computed. “Formation” was defined as having 80% of the average number of hydrogen bonds that are present in the native state, but variations of this threshold did not change the results qualitatively. The probability that hairpin 1 forms before hairpin 2 was computed from Eq. 4: In 30% of the folding trajectories, hairpin 1 forms before hairpin 2 (confidence interval 18%–34%) and in 70% it is the other way around. Thus, there is no unique mechanism in terms of the order of secondary structure formation, which is in qualitative agreement with a structural interpretation of mutational Φ values for the PinWW domain (34).
In order to visualize the “essential folding pathways,” coarse conformational sets were defined, onto which the folding flux was projected (see Theory). We employed a definition of 50 sets that separate the most slowly converting (“metastable”) parts of state space. The number of sets can be chosen by fixing a time scale of interest (here 100 ns); then the number of metastable sets are given by the number of implied time scales of the transition matrix slower than that time scale of interest (15). The definition of metastable states can be obtained from eigenvectors of the transition matrix T(τ) as suggested in refs. 15, 18, and 35 (see SI Appendix for details). Fig. 3 shows the network of the 70% most relevant pathways, which involves only 21 of these 50 conformational sets. The remaining 30% of the flux is mainly in small pathways between the structures shown in Fig. 3 and is omitted here for clarity of the visualization. The 29 of the 50 conformational sets not shown in the figure are only weakly involved in the A → B flux.
The denatured set (A) consists of mostly globular structures. No completely stretched structures are observed in the simulation. The coarsegrained folding flux suggests that there is a large number of unfolded states and early intermediates that narrow down when coming closer to the native state. The picture reemphasizes the existence of many structurally different parallel pathways. Pathways where hairpin 1 forms first are shown on the right, pathways where hairpin 2 forms first on the left. It is apparent that the pathways in which hairpin 1 forms first also include some partially helical structures formed by the sequence that will later become the third β strand.
Fig. 3 also indicates whether a set of structures with hairpins formed has the same register pattern as in the native state (0) or is registershifted by one or two residues (1,2). Most of the productive folding pathways proceed from no hairpins over onregister intermediates to the native state. Some of the foldingefficient structures have the smaller hairpin 2 registershifted, but none of them have hairpin 1 registershifted. A special case is a structure which has both chain ends curled in such a way that they are onregister near the termini but registershifted by 2 residues in between (indicated by “0–2”).
For the 50 coarse states defined here, the coarse flux network was decomposed into individual pathways according to decreasing flux as described in Theory. The Upper frame of Fig. 4 shows the cumulative flux depending on the number of pathways, showing that about 3–5 pathways are needed to carry 50% of the total flux and about 11–20 pathways are needed to carry 90% of the total flux. Although the absolute number of parallel pathways depends on the number of states one defines, i.e., on the amount of coarsegraining, the structural differences between the 50 sets defined here imply a remarkable degree of parallelness of the folding mechanism in the present system.
The six pathways which carry most of the total flux are depicted in the Lower frame of Fig. 4, highlighting that there are routes where hairpin 1 forms first (paths 3,4,6), where hairpin 2 forms first (paths 1,2), and where there is a more or less concurrent formation of both (path 5). Note that the percentages of individual pathways given in Fig. 4 should not be misinterpreted as the absolute probability of finding the exact sequence of conformations. For example, these pathways do not consider the possibility of recrossing events or changing between different paths. However, these percentages do provide the relative probabilities of choosing each folding pathway from the ensemble of productive folding pathways. For example, pathway 1 is nearly twice as probable as pathway 6.
Interestingly, there are three metastable sets that contribute almost no folding flux (<5%), but the system still spends a significant fraction of the time in them (stationary probability 18% with confidence intervals 3%–45%). These “trap” states, depicted in Fig. 3, have almost full β content, but the hairpins are registershifted with respect to the native structure, in particular at hairpin 1, which is not fully shifted in any of the intermediates that significantly contribute to the folding flux. The effective flux (Eq. 2), reveals that these traps are accessible from different metastable states, all of which already have a register shift in hairpin 2 or a partial register shift in hairpin 1 (see Fig. 3).
Removing the trap states from the Markov model increases the absolute folding rate k_{AB} (Eq. 1), by almost a factor of 2, showing that there is a significant probability that the system gets stuck in one of the trap states for some time.
Conclusions
This study suggests an approach to extract the full equilibrium ensemble of folding pathways from short simulations started out of equilibrium.
The approach was applied to MD simulations of the PinWW miniprotein whose individual length was 2 orders of magnitude below the slowest time scale in the system. Nevertheless, the kinetic model computed here is consistent both with the detailed shorttime information contained in the MD simulations and the longtime observables available from experiments.
The results suggest that at the simulation temperature (360 K), there is no unique or statistically dominant folding pathway in terms of the order of secondary structure formation, although hairpin 2 demonstrates a preference for forming before hairpin 1 (70% probability). The ϕ values being larger for hairpin 1 than for hairpin 2 in refs. 26 and 27 indicates a preference for hairpin 1 forming prior to hairpin 2 at temperatures around 320 K, and thus a reverse preference of pathways at these temperatures. This indication is consistent with the present results in that the larger hairpin 1 is expected to have both a larger enthalpic contribution stabilizing its folded state and a larger entropic contribution destabilizing it, which would increase upon increasing temperature. The folding pathway ensemble also includes pathways where both hairpins are partially formed and pathways that include transient αhelical structure.
Outside the efficient folding flux network, trap states have been found comprising registershifted, i.e. “misfolded” structures. The trap is accessible from several foldingefficient conformations, which have a small degree of registershift already. The presence of the trap slows down folding by nearly a factor of two. The existence of this trap should be experimentally testable, e.g., with timedependent IR techniques using sitespecific labeling techniques sensitive to registershifted conformations of hairpin 1. The model also predicts that destabilizing these trap states by mutations that would disfavor misregistered hairpin configurations could speed up the folding significantly.
Although the present results allow no direct conclusions regarding the folding kinetics of PinWW at body temperature, they do suggest that protein folding kinetics may often be more parallel and more complex than intuitively expected from experimental evidence of twostate thermodynamics and kinetics. This finding agrees with the fact that conformational heterogeneity has been observed in a few experiments that have been designed to look for it (36, 37). Moreover, the picture we suggest here is fully compatible with the widely accepted foldingfunnel model (38, 39), which suggests a narrowing down of a large conformational heterogeneity to the native conformations via parallel routes. The existence of parallel pathways is also supported by protein folding experiments (6, 7, 36, 37). As a result, our study suggests that a purely mechanistic question, such as “In which order do secondary structure elements fold?” is illdefined and should rather be replaced by a probabilistic question, such as “What is the probability of a particular order of structureformation events under a particular set of conditions?”
The combination of simulation, Markov models, and transitionpath theory suggested here is a practical route to study the detailed folding kinetics of small to moderately sized macromolecules for which a sufficiently large number of explicit solvent trajectories can be generated on available parallel computing facilities. The approach avoids a biased or oversimplified model that would result from projection onto a single or few predefined reaction coordinates and could thus pave the way toward new insights into protein folding kinetics.
In a broader sense, the present approach will be useful to study the kinetics of many other biophysical processes, including protein misfolding, conformational transitions in the native state, complex enzymatic reactions, protein:ligand binding, and protein:protein aggregation.
Acknowledgments
The authors are indebted to John D. Chodera, Vijay Pande, Martin Gruebele, and Volker Knecht for enlightening discussions. F.N. and C.S. acknowledge German Science Foundation for funding through the research center Matheon.
Footnotes
 ^{1}To whom correspondence should be addressed. Email: frank.noe{at}fuberlin.de

Author contributions: F.N., C.S., E.V.E., and T.R.W. designed research; F.N. and L.R. performed research; F.N. and L.R. analyzed data; and F.N., C.S., E.V.E., and T.R.W. wrote the paper.

The authors declare no conflict of interest.

This article is a PNAS Direct Submission.

See Commentary on page 18879.

This article contains supporting information online at www.pnas.org/cgi/content/full/0905466106/DCSupplemental.

Freely available online through the PNAS open access option.
References
 ↵
 Kennedy D,
 Norman C
 ↵
 ↵
 Feng H,
 Zhou Z,
 Bai Y
 ↵
 ↵
 ↵
 Goldbeck RA,
 Thomas YG,
 Chen E,
 Esquerra RM,
 Kliger DS
 ↵
 ↵
 ↵
 ↵
 Ferrara P,
 Caflisch A
 ↵
 ↵
 Lei H,
 Wu C,
 Liu H,
 Duan Y
 ↵
 ↵
 Fersht AR
 ↵
 ↵
 ↵
 ↵
 ↵
 ↵
 ↵
 Krivov SV,
 Karplus M
 ↵
 ↵
 ↵
 ↵
 ↵
 ↵
 ↵
 Jäger M,
 et al.
 ↵
 Liu F,
 et al.
 ↵
 ↵
 ↵
 ↵
 ↵
 ↵
 Weber M
 ↵
 ↵
 Mello CC,
 Barrick D
 ↵
 ↵
 Wolynes PG,
 Onuchic JN,
 Thirumalai D
Citation Manager Formats
Sign up for Article Alerts
Article Classifications
 Biological Sciences
 Biophysics and Computational Biology