Rapid local synchronization of action potentials: toward computation with coupled integrate-and-fire neurons.

The collective behavior of interconnected spiking nerve cells is investigated. It is shown that a variety of model systems exhibit the same short-time behavior and rapidly converge to (approximately) periodic firing patterns with locally synchronized action potentials. The dynamics of one model can be described by a downhill motion on an abstract energy landscape. Since an energy landscape makes it possible to understand and program computation done by an attractor network, the results will extend our understanding of collective computation from models based on a firing-rate description to biologically more realistic systems with integrate-and-fire neurons.

Toward an outline of the topography of a realistic protein-folding funnel.

Experimental information on the structure and dynamics of molten globules gives estimates for the energy landscape's characteristics for folding highly helical proteins, when supplemented by a theory of the helix-coil transition in collapsed heteropolymers. A law of corresponding states relating simulations on small lattice models to real proteins possessing many more degrees of freedom results. This correspondence reveals parallels between "minimalist" lattice results and recent experimental results for the degree of native character of the folding transition state and molten globule and also pinpoints the needs of further experiments.

Top-down free-energy minimization on protein potential energy landscapes

The hierarchical properties of potential energy landscapes have been used to gain insight into thermodynamic and kinetic properties of protein ensembles. It also may be possible to use them to direct computational searches for thermodynamically stable macroscopic states, i.e., computational protein folding. To this end, we have developed a top-down search procedure in which conformation space is recursively dissected according to the intrinsic hierarchical structure of a landscape's effective-energy barriers. This procedure generates an inverted tree similar to the disconnectivity graphs generated by local minima-clustering methods, but it fundamentally differs in the manner in which the portion of the tree that is to be computationally explored is selected. A key ingredient is a branch-selection algorithm that takes advantage of statistically predictive properties of the landscape to guide searches down the tree branches that are most likely to lead to the physically relevant macroscopic states. Using the computational folding of a β-hairpin-forming peptide as an example, we show that such predictive properties indeed exist and can be used for structure prediction by free-energy global minimization.