Proteornics analysis unravels the functional repertoire of coronavirus nonstructural protein 3

Severe acute respiratory syndrome (SARS) coronavirus infection and growth are dependent on initiating signaling and enzyme actions upon viral entry into the host cell. Proteins packaged during virus assembly may subsequently form the first line of attack and host manipulation upon infection. A complete characterization of virion components is therefore important to understanding the dynamics of early stages of infection. Mass spectrometry and kinase profiling techniques identified nearly 200 incorporated host and viral proteins. We used published interaction data to identify hubs of connectivity with potential significance for virion formation. Surprisingly, the hub with the most potential connections was not the viral M protein but the nonstructurall protein 3 (nsp3), which is one of the novel virion components identified by mass spectrometry. Based on new experimental data and a bioinformatics analysis across the Coronaviridae, we propose a higher-resolution functional domain architecture for nsp3 that determines the interaction capacity of this protein. Using recombinant protein domains expressed in Escherichia coli, we identified two additional RNA-binding domains of nsp3. One of these domains is located within the previously described SARS-unique domain, and there is a nucleic acid chaperone-like domain located immediately downstream of the papain-like proteinase domain. We also identified a novel cysteine-coordinated metal ion-binding domain. Analyses of interdomain interactions and provisional functional annotation of the remaining, so-far-uncharacterized domains are presented. Overall, the ensemble of data surveyed here paint a more complete picture of nsp3 as a conserved component of the viral protein processing machinery, which is intimately associated with viral RNA in its role as a virion component.

Assembly rules for protein networks derived from phylogenetic-statistical analysis of whole genomes

Background: We report an analysis of a protein network of functionally linked proteins, identified from a phylogenetic statistical analysis of complete eukaryotic genomes. Phylogenetic methods identify pairs of proteins that co-evolve on a phylogenetic tree, and have been shown to have a high probability of correctly identifying known functional links. Results: The eukaryotic correlated evolution network we derive displays the familiar power law scaling of connectivity. We introduce the use of explicit phylogenetic methods to reconstruct the ancestral presence or absence of proteins at the interior nodes of a phylogeny of eukaryote species. We find that the connectivity distribution of proteins at the point they arise on the tree and join the network follows a power law, as does the connectivity distribution of proteins at the time they are lost from the network. Proteins resident in the network acquire connections over time, but we find no evidence that 'preferential attachment' - the phenomenon of newly acquired connections in the network being more likely to be made to proteins with large numbers of connections - influences the network structure. We derive a 'variable rate of attachment' model in which proteins vary in their propensity to form network interactions independently of how many connections they have or of the total number of connections in the network, and show how this model can produce apparent power-law scaling without preferential attachment. Conclusion: A few simple rules can explain the topological structure and evolutionary changes to protein-interaction networks: most change is concentrated in satellite proteins of low connectivity and small phenotypic effect, and proteins differ in their propensity to form attachments. Given these rules of assembly, power law scaled networks naturally emerge from simple principles of selection, yielding protein interaction networks that retain a high-degree of robustness on short time scales and evolvability on longer evolutionary time scales.

Helices, chirality and interpenetration: the versatility and remarkable interconversion of silver-copper cyanide frameworks

The structural transformations between cesium silver-copper cyanides under modest conditions, both in solution and in the solid state, are described. Three new cesium silver(I) copper(I) cyanides with three-dimensional (3-D) framework structures were prepared as single crystals from a one-pot reaction initially heated under hydrothermal conditions. The first product to appear, Cs3Ag2Cu3(CN)(8) (I), when left in contact with the supernatant produced CsAgCu(CN)(3) (II) and CsAgCu(CN)(3)center dot 1/3H(2)O (III) over a few months via a series of thermodynamically controlled cascade reactions. Crystals of the hydrate (III) can be dehydrated to polycrystalline CsAgCu(CN)(3) (II) on heating at 100 degrees C in a remarkable solid-state transformation involving substantial breaking and reconnection of metal-cyanide linkages. Astonishingly, the conversion between the two known polymorphs of CsAg2Cu(CN)(4), which also involves a major change in connectivity and topology, occurs at 180 degrees C as a single-crystal to single-crystal transformation. Structural features of note in these materials include the presence of helical copper-cyanide chains in (I) and (II), which in the latter compound produce a chiral material. In (II) and (III), the silver-copper cyanide networks are both self- and interpenetrating, features also seen in the known polymorphs of CsAg2Cu(CN)(4).

The impact of flavonoids on memory: physiological and molecular considerations

Emerging evidence suggests that a group of dietary-derived phytochemicals known as flavonoids are able to induce improvements in memory acquisition, consolidation, storage and retrieval. These low molecular weight polyphenols are widespread in the human diet, are absorbed to only a limited degree and localise in the brain at low concentration. However, they have been found to be highly effective in reversing age-related declines in memory via their ability to interact with the cellular and molecular architecture of the brain responsible for memory. These interactions include an ability to activate signalling pathways, critical in controlling synaptic plasticity, and a potential to induce vascular effects capable of causing new nerve cell growth in the hippocampus. Their ability to activate the extracellular signal-regulated kinase (ERK1/2) and the protein kinase B (PKB/Akt) signalling pathways, leading to the activation of the cAMP response element-binding protein (CREB), a transcription factor responsible for increasing the expression of a number of neurotrophins important in de. ning memory, will be discussed. How these effects lead to improvements in memory through induction of synapse growth and connectivity, increases in dendritic spine density and the functional integration of old and new neurons will be illustrated. The overall goal of this critical review is to emphasize future areas of investigation as well as to highlight these dietary agents as promising candidates for the design of memory-enhancing drugs with relevance to normal and pathological brain ageing (161 references).

The roles of perirhinal cortex, postrhinal cortex, and the fornix in memory for objects, contexts, and events in the rat

Investigation of the anatomical substructure of the medial temporal lobe has revealed a number of highly interconnected areas, which has led some to propose that the region operates as a unitary memory system. However, here we outline the results of a number of studies from our laboratories, which investigate the contributions of the rat's perirhinal cortex and postrhinal cortex to memory, concentrating particularly on their respective roles in memory for objects. By contrasting patterns of impairment and spared abilities on a number of related tasks, we suggest that perirhinal cortex and postrhinal cortex make distinctive contributions to learning and memory: for example, that postrhinal cortex is important in learning about within-scene position and context. We also provide evidence that despite the strong connectivity between these cortical regions and the hippocampus, the hippocampus, as evidenced by lesions of the fornix, has a distinct function of its own-combining information about objects, positions, and contexts.

Simulating global properties of electroencephalograms with minimal random neural networks

The human electroencephalogram (EEG) is globally characterized by a 1/f power spectrum superimposed with certain peaks, whereby the "alpha peak" in a frequency range of 8-14 Hz is the most prominent one for relaxed states of wakefulness. We present simulations of a minimal dynamical network model of leaky integrator neurons attached to the nodes of an evolving directed and weighted random graph (an Erdos-Renyi graph). We derive a model of the dendritic field potential (DFP) for the neurons leading to a simulated EEG that describes the global activity of the network. Depending on the network size, we find an oscillatory transition of the simulated EEG when the network reaches a critical connectivity. This transition, indicated by a suitably defined order parameter, is reflected by a sudden change of the network's topology when super-cycles are formed from merging isolated loops. After the oscillatory transition, the power spectra of simulated EEG time series exhibit a 1/f continuum superimposed with certain peaks. (c) 2007 Elsevier B.V. All rights reserved.

Improvement of link failure restoration utilising MPLS as a means to maintain QoS

The availability of a network strongly depends on the frequency of service outages and the recovery time for each outage. The loss of network resources includes complete or partial failure of hardware and software components, power outages, scheduled maintenance such as software and hardware, operational errors such as configuration errors and acts of nature such as floods, tornadoes and earthquakes. This paper proposes a practical approach to the enhancement of QoS routing by means of providing alternative or repair paths in the event of a breakage of a working path. The proposed scheme guarantees that every Protected Node (PN) is connected to a multi-repair path such that no further failure or breakage of single or double repair paths can cause any simultaneous loss of connectivity between an ingress node and an egress node. Links to be protected in an MPLS network are predefined and an LSP request involves the establishment of a working path. The use of multi-protection paths permits the formation of numerous protection paths allowing greater flexibility. Our analysis will examine several methods including single, double and multi-repair routes and the prioritization of signals along the protected paths to improve the Quality of Service (QoS), throughput, reduce the cost of the protection path placement, delay, congestion and collision.

The locally twisted cubes

This paper introduces a new variant of the popular n-dimensional hypercube network Q(n), known as the n-dimensional locally twisted cube LTQ(n), which has the same number of nodes and the same number of connections per node as Q(n). Furthermore. LTQ(n) is similar to Q(n) in the sense that the nodes can be one-to-one labeled with 0-1 binary sequences of length n. so that the labels of any two adjacent nodes differ in at most two successive bits. One advantage of LTQ(n) is that the diameter is only about half of the diameter of Q(n) We develop a simple routing algorithm for LTQ(n), which creates a shortest path from the source to the destination in O(n) time. We find that LTQ(n) consists of two disjoint copies of Q(n) by adding a matching between their nodes. On this basis. we show that LTQ(n) has a connectivity of n.

Fault tolerance of Mobius cubes under two forbidden fault set models

An n-dimensional Mobius cube, 0MQ(n) or 1MQ(n), is a variation of n-dimensional cube Q(n) which possesses many attractive properties such as significantly smaller communication delay and stronger graph-embedding capabilities. In some practical situations, the fault tolerance of a distributed memory multiprocessor system can be measured more precisely by the connectivity of the underlying graph under forbidden fault set models. This article addresses the connectivity of 0MQ(n)/1MQ(n), under two typical forbidden fault set models. We first prove that the connectivity of 0MQ(n)/1MQ(n) is 2n - 2 when the fault set does not contain the neighborhood of any vertex as a subset. We then prove that the connectivity of 0MQ(n)/1MQ(n) is 3n - 5 provided that the neighborhood of any vertex as well as that of any edge cannot fail simultaneously These results demonstrate that 0MQ(n)/1MQ(n) has the same connectivity as Q(n) under either of the previous assumptions.

Models for evolving networks: with applications in telecommunication and online activities

Driven by a range of modern applications that includes telecommunications, e-business and on-line social interaction, recent ideas in complex networks can be extended to the case of time-varying connectivity. Here we propose a general frame- work for modelling and simulating such dynamic networks, and we explain how the long time behaviour may reveal important information about the mechanisms underlying the evolution.

Neural competition for conscious representation across time: An fMRI study

Background The information processing capacity of the human mind is limited, as is evidenced by the attentional blink (AB) - a deficit in identifying the second of two temporally-close targets (T1 and T2) embedded in a rapid stream of distracters. Theories of the AB generally agree that it results from competition between stimuli for conscious representation. However, they disagree in the specific mechanisms, in particular about how attentional processing of T1 determines the AB to T2. Methodology/Principal Findings The present study used the high spatial resolution of functional magnetic resonance imaging (fMRI) to examine the neural mechanisms underlying the AB. Our research approach was to design T1 and T2 stimuli that activate distinguishable brain areas involved in visual categorization and representation. ROI and functional connectivity analyses were then used to examine how attentional processing of T1, as indexed by activity in the T1 representation area, affected T2 processing. Our main finding was that attentional processing of T1 at the level of the visual cortex predicted T2 detection rates Those individuals who activated the T1 encoding area more strongly in blink versus no-blink trials generally detected T2 on a lower percentage of trials. The coupling of activity between T1 and T2 representation areas did not vary as a function of conscious T2 perception. Conclusions/Significance These data are consistent with the notion that the AB is related to attentional demands of T1 for selection, and indicate that these demands are reflected at the level of visual cortex. They also highlight the importance of individual differences in attentional settings in explaining AB task performance.

The role of management and landscape context in the restoration of grassland phytophagous beetles

1. Declines in area and quality of species-rich mesotrophic and calcareous grasslands have occurred all across Europe.While the European Union has promoted schemes to restore these grasslands, the emphasis for management has remained largely focused on plants. Here we focus on restoration of the phytophagous beetles of these grasslands. Although local management, particularly that which promotes the establishment of host plants, is key to restoration success, dispersal limitation is also likely to be an important limiting factor during the restoration of phytophagous beetle assemblages. 2. Using a 3-year multi-site experiment, we investigated how restoration success of phytophagous beetles was affected by hay-spreading management (intended to introduce target plant species), success in restoration of the plant communities and the landscape context within which restoration was attempted. 3. Restoration success of the plants was greatest where green hay spreading had been used to introduce seeds into restoration sites. Beetle restoration success increased over time, although hayspreading had no direct effect. However, restoration success of the beetles was positively correlated with restoration success of the plants. 4. Overall restoration success of the phytophagous beetles was positively correlated with the proportion of species-rich grassland in the landscape, as was the restoration success of the polyphagous beetles. Restoration success for beetles capable of flight and those showing oligophagous host plant specialism were also positively correlated with connectivity to species-rich grasslands. There was no indication that beetles not capable of flight showed greater dependence on landscape scale factors than flying species. 5. Synthesis and applications. Increasing the similarity of the plant community at restoration sites to target species-rich grasslands will promote restoration success for the phytophagous beetles. However, landscape context is also important, with restoration being approximately twice as successful in those landscapes containing high as opposed to low proportions of species-rich grassland. By targeting grassland restoration within landscapes containing high proportions of species-rich grassland, dispersal limitation problems associated with restoration for invertebrate assemblages are more likely to be overcome.

The functional neuroanatomy of the evolving parent–infant relationship

Infant survival and the development of secure and cooperative relationships are central to the future of the species. In humans, this relies heavily on the evolving early parent–infant social and affective relationship. While much is known about the behavioural and psychological components of this relationship, relatively little is known about the underlying functional neuroanatomy. Affective and social neuroscience has helped to describe the main adult brain networks involved, but has so far engaged very little with developmental findings. In this review, we seek to highlight future avenues for research by providing a coherent framework for describing the parent–infant relationship over the first 18 months. We provide an outline of the evolving nature of the relationship, starting with basic orienting and recognition processes, and culminating in the infant's attainment of higher socio-emotional and cognitive capacities. Key social and affective interactions, such as communication, cooperative play and the establishment of specific attachments propel the development of the parent–infant relationship. We summarise our current knowledge of the developing infant brain in terms of structure and function, and how these relate to the emergent abilities necessary for the formation of a secure and cooperative relationship with parents or other caregivers. Important roles have been found for brain regions including the orbitofrontal, cingulate, and insular cortices in parent–infant interactions, but it has become clear that much more information is needed about the developmental time course and connectivity of these regions.

Small-world effects in lattice stochastic diffusion search

Stochastic Diffusion Search is an efficient probabilistic bestfit search technique, capable of transformation invariant pattern matching. Although inherently parallel in operation it is difficult to implement efficiently in hardware as it requires full inter-agent connectivity. This paper describes a lattice implementation, which, while qualitatively retaining the properties of the original algorithm, restricts connectivity, enabling simpler implementation on parallel hardware. Diffusion times are examined for different network topologies, ranging from ordered lattices, over small-world networks to random graphs.

Generation, description and storage of dendritic morphology data

It is generally assumed that the variability of neuronal morphology has an important effect on both the connectivity and the activity of the nervous system, but this effect has not been thoroughly investigated. Neuroanatomical archives represent a crucial tool to explore structure–function relationships in the brain. We are developing computational tools to describe, generate, store and render large sets of three–dimensional neuronal structures in a format that is compact, quantitative, accurate and readily accessible to the neuroscientist. Single–cell neuroanatomy can be characterized quantitatively at several levels. In computer–aided neuronal tracing files, a dendritic tree is described as a series of cylinders, each represented by diameter, spatial coordinates and the connectivity to other cylinders in the tree. This ‘Cartesian’ description constitutes a completely accurate mapping of dendritic morphology but it bears little intuitive information for the neuroscientist. In contrast, a classical neuroanatomical analysis characterizes neuronal dendrites on the basis of the statistical distributions of morphological parameters, e.g. maximum branching order or bifurcation asymmetry. This description is intuitively more accessible, but it only yields information on the collective anatomy of a group of dendrites, i.e. it is not complete enough to provide a precise ‘blueprint’ of the original data. We are adopting a third, intermediate level of description, which consists of the algorithmic generation of neuronal structures within a certain morphological class based on a set of ‘fundamental’, measured parameters. This description is as intuitive as a classical neuroanatomical analysis (parameters have an intuitive interpretation), and as complete as a Cartesian file (the algorithms generate and display complete neurons). The advantages of the algorithmic description of neuronal structure are immense. If an algorithm can measure the values of a handful of parameters from an experimental database and generate virtual neurons whose anatomy is statistically indistinguishable from that of their real counterparts, a great deal of data compression and amplification can be achieved. Data compression results from the quantitative and complete description of thousands of neurons with a handful of statistical distributions of parameters. Data amplification is possible because, from a set of experimental neurons, many more virtual analogues can be generated. This approach could allow one, in principle, to create and store a neuroanatomical database containing data for an entire human brain in a personal computer. We are using two programs, L–NEURON and ARBORVITAE, to investigate systematically the potential of several different algorithms for the generation of virtual neurons. Using these programs, we have generated anatomically plausible virtual neurons for several morphological classes, including guinea pig cerebellar Purkinje cells and cat spinal cord motor neurons. These virtual neurons are stored in an online electronic archive of dendritic morphology. This process highlights the potential and the limitations of the ‘computational neuroanatomy’ strategy for neuroscience databases.