Computational analysis of the LRRK2 interactome

LRRK2 was identified in 2004 as the causative protein product of the Parkinson’s disease locus designated PARK8. In the decade since then, genetic studies have revealed at least 6 dominant mutations in LRRK2 linked to Parkinson’s disease, alongside one associated with cancer. It is now well established that coding changes in LRRK2 are one of the most common causes of Parkinson’s. Genome-wide association studies (GWAs) have, more recently, reported single nucleotide polymorphisms (SNPs) around the LRRK2 locus to be associated with risk of developing sporadic Parkinson’s disease and inflammatory bowel disorder. The functional research that has followed these genetic breakthroughs has generated an extensive literature regarding LRRK2 pathophysiology; however, there is still no consensus as to the biological function of LRRK2. To provide insight into the aspects of cell biology that are consistently related to LRRK2 activity, we analysed the plethora of candidate LRRK2 interactors available through the BioGRID and IntAct data repositories. We then performed GO terms enrichment for the LRRK2 interactome. We found that, in two different enrichment portals, the LRRK2 interactome was associated with terms referring to transport, cellular organization, vesicles and the cytoskeleton. We also verified that 21 of the LRRK2 interactors are genetically linked to risk for Parkin- son’s disease or inflammatory bowel disorder. The implications of these findings are discussed, with particular regard to potential novel areas of investigation.

Synapses in digital medium: computational investigations of neural basis of anticipation

Anticipation is an emerging concept that can provide a bridge between the deepest philosophical theories about the nature of life and cognition on one hand and the empirical biological sciences steeped in reductionist and Newtonian conception of causality. Three conceptions of anticipation have been emerging from the literature that may be operationalised in a way leading to a viable empirical programme. The discussion of the research into a novel dynamical concept of anticipating synchronisation lends credence to such a possibility and suggests further links between the three anticipation paradigms. A careful progress mindful to the deep philosophical concerns but also respecting empirical evidence will ultimately lead towards unifying theoretical and empirical biological sciences and may offer progress where reductionist science have been so far faltering.

A new topology of ACBP from Moniliophthora perniciosa

Acyl-CoA binding protein (ACBP) is a housekeeping protein and is an essential protein in human cell lines and in Trypanosoma brucei. The ACBP of Moniliophthora perniciosa is composed of 104 amino acids and is possibly a non-classic isoform exclusively from Basidiomycetes. The M. perniciosa acbp gene was cloned, and the protein was expressed and purified. Acyl-CoA ester binding was analyzed by isoelectric focusing, native gel electrophoresis and isothermal titration calorimetry. Our results suggest an increasing affinity of ACBP for longer acyl-CoA esters, such as myristoyl-CoA to arachidoyl-CoA, and best fit modeling indicates two binding sites. ACBP undergoes a shift from a monomeric to a dimeric state, as shown by dynamic light scattering, fluorescence anisotropy and native gel electrophoresis in the absence and presence of the ligand. The protein`s structure was determined at 1.6 angstrom resolution and revealed a new topology for ACBP, containing five a-helices instead of four. alpha-helices 1, 2, 3 and 4 adopted a bundled arrangement that is unique from the previously determined four-helix folds of ACBP, while alpha-helices 1, 2, 4 and 5 formed a classical four-helix bundle. A MES molecule was found in the CoA binding site, suggesting that the CoA site could be a target for small compound screening. (C) 2009 Elsevier B.V. All rights reserved.

Population and Computational Analysis of the MGEA6 P521A Variation as a Risk Factor for Familial Idiopathic Basal Ganglia Calcification (Fahr`s Disease)

Familial idiopathic basal ganglia calcification, also known as ""Fahr`s disease"" (FD), is a neuropsychiatric disorder with autosomal dominant pattern of inheritance and characterized by symmetric basal ganglia calcifications and, occasionally, other brain regions. Currently, there are three loci linked to this devastating disease. The first one (IBGC1) is located in 14q11.2-21.3 and the other two have been identified in 2q37 (IBGC2) and 8p21.1-q11.13 (IBGC3). Further studies identified a heterozygous variation (rs36060072) which consists in the change of the cytosine to guanine located at MGEA6/CTAGE5 gene, present in all of the affected large American family linked to IBGC1. This missense substitution, which induces changes of a proline to alanine at the 521 position (P521A), in a proline-rich and highly conserved protein domain was considered a rare variation, with a minor allele frequency (MAF) of 0.0058 at the US population. Considering that the population frequency of a given variation is an indirect indicative of potential pathogenicity, we screened 200 chromosomes in a random control set of Brazilian samples and in two nuclear families, comparing with our previous analysis in a US population. In addition, we accomplished analyses through bioinformatics programs to predict the pathogenicity of such variation. Our genetic screen found no P521A carriers. Polling these data together with the previous study in the USA, we have now a MAF of 0.0036, showing that this mutation is very rare. On the other hand, the bioinformatics analysis provided conflicting findings. There are currently various candidate genes and loci that could be involved with the underlying molecular basis of FD etiology, and other groups suggested the possible role played by genes in 2q37, related to calcium metabolism, and at chromosome 8 (NRG1 and SNTG1). Additional mutagenesis and in vivo studies are necessary to confirm the pathogenicity for variation in the P521A MGEA6.

A psychophysical and computational analysis of the spatio-temporal mechanisms underlying the flash-lag effect

Several accounts put forth to explain the flash-lag effect (FLE) rely mainly on either spatial or temporal mechanisms. Here we investigated the relationship between these mechanisms by psychophysical and theoretical approaches. In a first experiment we assessed the magnitudes of the FLE and temporal-order judgments performed under identical visual stimulation. The results were interpreted by means of simulations of an artificial neural network, that wits also employed to make predictions concerning the F LE. The model predicted that a spatio-temporal mislocalisation would emerge from two, continuous and abrupt-onset, moving stimuli. Additionally, a straightforward prediction of the model revealed that the magnitude of this mislocalisation should be task-dependent, increasing when the use of the abrupt-onset moving stimulus switches from a temporal marker only to both temporal and spatial markers. Our findings confirmed the model`s predictions and point to an indissoluble interplay between spatial facilitation and processing delays in the FLE.

Black-box decomposition approach for computational hemodynamics: One-dimensional models

Increasing efforts exist in integrating different levels of detail in models of the cardiovascular system. For instance, one-dimensional representations are employed to model the systemic circulation. In this context, effective and black-box-type decomposition strategies for one-dimensional networks are needed, so as to: (i) employ domain decomposition strategies for large systemic models (1D-1D coupling) and (ii) provide the conceptual basis for dimensionally-heterogeneous representations (1D-3D coupling, among various possibilities). The strategy proposed in this article works for both of these two scenarios, though the several applications shown to illustrate its performance focus on the 1D-1D coupling case. A one-dimensional network is decomposed in such a way that each coupling point connects two (and not more) of the sub-networks. At each of the M connection points two unknowns are defined: the flow rate and pressure. These 2M unknowns are determined by 2M equations, since each sub-network provides one (non-linear) equation per coupling point. It is shown how to build the 2M x 2M non-linear system with arbitrary and independent choice of boundary conditions for each of the sub-networks. The idea is then to solve this non-linear system until convergence, which guarantees strong coupling of the complete network. In other words, if the non-linear solver converges at each time step, the solution coincides with what would be obtained by monolithically modeling the whole network. The decomposition thus imposes no stability restriction on the choice of the time step size. Effective iterative strategies for the non-linear system that preserve the black-box character of the decomposition are then explored. Several variants of matrix-free Broyden`s and Newton-GMRES algorithms are assessed as numerical solvers by comparing their performance on sub-critical wave propagation problems which range from academic test cases to realistic cardiovascular applications. A specific variant of Broyden`s algorithm is identified and recommended on the basis of its computer cost and reliability. (C) 2010 Elsevier B.V. All rights reserved.

Two-level network design with intermediate facilities: An application to electrical distribution systems

We consider the two-level network design problem with intermediate facilities. This problem consists of designing a minimum cost network respecting some requirements, usually described in terms of the network topology or in terms of a desired flow of commodities between source and destination vertices. Each selected link must receive one of two types of edge facilities and the connection of different edge facilities requires a costly and capacitated vertex facility. We propose a hybrid decomposition approach which heuristically obtains tentative solutions for the vertex facilities number and location and use these solutions to limit the computational burden of a branch-and-cut algorithm. We test our method on instances of the power system secondary distribution network design problem. The results show that the method is efficient both in terms of solution quality and computational times. (C) 2010 Elsevier Ltd. All rights reserved.

A computational study of some rheological influences on the ""splashing experiment""

In various attempts to relate the behaviour of highly-elastic liquids in complex flows to their rheometrical behaviour, obvious candidates for study have been the variation of shear viscosity with shear rate, the two normal stress differences N(1) and N(2), especially N(1), the extensional viscosity, and the dynamic moduli G` and G ``. In this paper, we shall confine attention to `constant-viscosity` Boger fluids, and, accordingly, we shall limit attention to N(1), eta(E), G` and G ``. We shall concentrate on the ""splashing"" problem (particularly that which arises when a liquid drop falls onto the free surface of the same liquid). Modern numerical techniques are employed to provide the theoretical predictions. We show that high eta(E) can certainly reduce the height of the so-called Worthington jet, thus confirming earlier suggestions, but other rheometrical influences (steady and transient) can also have a role to play and the overall picture may not be as clear as it was once envisaged. We argue that this is due in the main to the fact that splashing is a manifestly unsteady flow. To confirm this proposition, we obtain numerical simulations for the linear Jeffreys model. (C) 2010 Elsevier B.V. All rights reserved.

Chaotic synchronization in general network topology for scene segmentation

Chaotic synchronization has been discovered to be an important property of neural activities, which in turn has encouraged many researchers to develop chaotic neural networks for scene and data analysis. In this paper, we study the synchronization role of coupled chaotic oscillators in networks of general topology. Specifically, a rigorous proof is presented to show that a large number of oscillators with arbitrary geometrical connections can be synchronized by providing a sufficiently strong coupling strength. Moreover, the results presented in this paper not only are valid to a wide class of chaotic oscillators, but also cover the parameter mismatch case. Finally, we show how the obtained result can be applied to construct an oscillatory network for scene segmentation.

A Productivity-Based Approach to LAN Topology Design

Over the useful life of a LAN, network downtimes will have a negative impact on organizational productivity not included in current Network Topological Design (NTD) problems. We propose a new approach to LAN topological design that includes the impact of these productivity losses into the network design, minimizing not only the CAPEX but also the expected cost of unproductiveness attributable to network downtimes over a certain period of network operation.

Integrable maps with non-trivial topology: application to divertor configurations

We explore a method for constructing two-dimensional area-preserving, integrable maps associated with Hamiltonian systems, with a given set of fixed points and given invariant curves. The method is used to find an integrable Poincare map for the field lines in a large aspect ratio tokamak with a poloidal single-null divertor. The divertor field is a superposition of a magnetohydrodynamic equilibrium with an arbitrarily chosen safety factor profile, with a wire carrying an electric current to create an X-point. This integrable map is perturbed by an impulsive perturbation that describes non-axisymmetric magnetic resonances at the plasma edge. The non-integrable perturbed map is applied to study the structure of the open field lines in the scrape-off layer, reproducing the main transport features obtained by integrating numerically the magnetic field line equations, such as the connection lengths and magnetic footprints on the divertor plate.

SZNAJD MODEL AND PROPORTIONAL ELECTIONS: THE ROLE OF THE TOPOLOGY OF THE NETWORK

The Sznajd model (SM) has been employed with success in the last years to describe opinion propagation in a community. In particular, it has been claimed that its transient is able to reproduce some scale properties observed in data of proportional elections, in different countries, if the community structure (the network) is scale-free. In this work, we investigate the properties of the transient of a particular version of the SM, introduced by Bernardes and co-authors in 2002. We studied the behavior of the model in networks of different topologies through the time evolution of an order parameter known as interface density, and concluded that regular lattices with high dimensionality also leads to a power-law distribution of the number of candidates with v votes. Also, we show that the particular absorbing state achieved in the stationary state (or else, the winner candidate), is related to a particular feature of the model, that may not be realistic in all situations.

Study of the phenanthroline-Mn-imidazole bonding in Mn(I) triscarbonyl complex: A X-ray and DFT computational analysis

355 nm light irradiation of fac-[Mn(CO)(3)(phen)(imH)](+) (fac-1) produces the mer-1 isomer and a long lived radical which can be efficiently trapped by electron acceptor molecules. EPR experiments shows that when excited, the manganese(I) complex can be readily oxidized by one-electron process to produce Mn(II) and phen(.-). In the present study, DFT calculations have been used to investigated the photochemical isomerization of the parent Mn(I) complex and to characterize the electronic structures of the long lived radical. The theoretical calculations have been performed on both the fac-1 and mer-1 species as well as on their one electron oxidized species fac-1+ and mer-1+ for the lowest spin configurations (S = 1/2) and fac-6 and mer-6 (S = 5/2) for the highest one to characterize these complexes. In particular, we used a charge decomposition analysis (CDA) and a natural bonding orbital (NBO) to have a better understanding of the chemical bonding in terms of the nature of electronic interactions. The observed variations in geometry and bond energies with an increasing oxidation state in the central metal ion are interpreted in terms of changes in the nature of metal-ligand bonding interactions. The X-ray structure of fac-1 is also described. (C) 2011 Elsevier B.V. All rights reserved.

3D face computational photography using PCA spaces

In this paper, we present a 3D face photography system based on a facial expression training dataset, composed of both facial range images (3D geometry) and facial texture (2D photography). The proposed system allows one to obtain a 3D geometry representation of a given face provided as a 2D photography, which undergoes a series of transformations through the texture and geometry spaces estimated. In the training phase of the system, the facial landmarks are obtained by an active shape model (ASM) extracted from the 2D gray-level photography. Principal components analysis (PCA) is then used to represent the face dataset, thus defining an orthonormal basis of texture and another of geometry. In the reconstruction phase, an input is given by a face image to which the ASM is matched. The extracted facial landmarks and the face image are fed to the PCA basis transform, and a 3D version of the 2D input image is built. Experimental tests using a new dataset of 70 facial expressions belonging to ten subjects as training set show rapid reconstructed 3D faces which maintain spatial coherence similar to the human perception, thus corroborating the efficiency and the applicability of the proposed system.