Genetic, structural, and molecular insights into the function of ras of complex proteins domains

Ras of complex proteins (ROC) domains were identified in 2003 as GTP binding modules in large multidomain proteins from Dictyostelium discoideum. Research into the function of these domains exploded with their identification in a number of proteins linked to human disease, including leucine-rich repeat kinase 2 (LRRK2) and death-associated protein kinase 1 (DAPK1) in Parkinson’s disease and cancer, respectively. This surge in research has resulted in a growing body of data revealing the role that ROC domains play in regulating protein function and signaling pathways. In this review, recent advances in the structural informa- tion available for proteins containing ROC domains, along with insights into enzymatic function and the integration of ROC domains as molecular switches in a cellular and organismal context, are explored.

Dynamic behavior of Arabidopsis eif4a-iii, putative core protein of exon junction complex: fast relocation to nucleolus and splicing speckles under hypoxia

Here, we identify the Arabidopsis thaliana ortholog of the mammalian DEAD box helicase, eIF4A-III, the putative anchor protein of exon junction complex (EJC) on mRNA. Arabidopsis eIF4A-III interacts with an ortholog of the core EJC component, ALY/Ref, and colocalizes with other EJC components, such as Mago, Y14, and RNPS1, suggesting a similar function in EJC assembly to animal eIF4A-III. A green fluorescent protein (GFP)-eIF4A-III fusion protein showed localization to several subnuclear domains: to the nucleoplasm during normal growth and to the nucleolus and splicing speckles in response to hypoxia. Treatment with the respiratory inhibitor sodium azide produced an identical response to the hypoxia stress. Treatment with the proteasome inhibitor MG132 led to accumulation of GFP-eIF4A-III mainly in the nucleolus, suggesting that transition of eIF4A-III between subnuclear domains and/or accumulation in nuclear speckles is controlled by proteolysis-labile factors. As revealed by fluorescence recovery after photobleaching analysis, the nucleoplasmic fraction was highly mobile, while the speckles were the least mobile fractions, and the nucleolar fraction had an intermediate mobility. Sequestration of eIF4A-III into nuclear pools with different mobility is likely to reflect the transcriptional and mRNA processing state of the cell.

Generalised Dirichelt-to-Neumann map in time dependent domains

We study the heat, linear Schrodinger and linear KdV equations in the domain l(t) < x < ∞, 0 < t < T, with prescribed initial and boundary conditions and with l(t) a given differentiable function. For the first two equations, we show that the unknown Neumann or Dirichlet boundary value can be computed as the solution of a linear Volterra integral equation with an explicit weakly singular kernel. This integral equation can be derived from the formal Fourier integral representation of the solution. For the linear KdV equation we show that the two unknown boundary values can be computed as the solution of a system of linear Volterra integral equations with explicit weakly singular kernels. The derivation in this case makes crucial use of analyticity and certain invariance properties in the complex spectral plane. The above Volterra equations are shown to admit a unique solution.

Fast regridding of large, complex geospatial datasets

In the earth sciences, data are commonly cast on complex grids in order to model irregular domains such as coastlines, or to evenly distribute grid points over the globe. It is common for a scientist to wish to re-cast such data onto a grid that is more amenable to manipulation, visualization, or comparison with other data sources. The complexity of the grids presents a significant technical difficulty to the regridding process. In particular, the regridding of complex grids may suffer from severe performance issues, in the worst case scaling with the product of the sizes of the source and destination grids. We present a mechanism for the fast regridding of such datasets, based upon the construction of a spatial index that allows fast searching of the source grid. We discover that the most efficient spatial index under test (in terms of memory usage and query time) is a simple look-up table. A kd-tree implementation was found to be faster to build and to give similar query performance at the expense of a larger memory footprint. Using our approach, we demonstrate that regridding of complex data may proceed at speeds sufficient to permit regridding on-the-fly in an interactive visualization application, or in a Web Map Service implementation. For large datasets with complex grids the new mechanism is shown to significantly outperform algorithms used in many scientific visualization packages.