Search PubMed⌕ Search

Biomedical subjects

Andrzej Kudlicki

Publications and source records attributed to Andrzej Kudlicki.

7 recordsLinked to original sources

Valosin-containing protein (p97) is a regulator of endoplasmic reticulum stress and of the degradation of N-end rule and ubiquitin-fusion degradation pathway substrates in mammalian cells.

Valosin-containing protein (VCP; p97; cdc48 in yeast) is a hexameric ATPase of the AAA family (ATPases with multiple cellular activities) involved in multiple cellular functions, including degradation of proteins by the ubiquitin (Ub)-proteasome system (UPS). We examined the consequences of the reduction of VCP levels after RNA interference (RNAi) of VCP. A new stringent method of microarray analysis demonstrated that only four transcripts were nonspecifically affected by RNAi, whereas approximately 30 transcripts were affected in response to reduced VCP levels in a sequence-independent manner. These transcripts encoded proteins involved in endoplasmic reticulum (ER) stress, apoptosis, and amino acid starvation. RNAi of VCP promoted the unfolded protein response, without eliciting a cytosolic stress response. RNAi of VCP inhibited the degradation of R-GFP (green fluorescent protein) and Ub-(G76V)-GFP, two cytoplasmic reporter proteins degraded by the UPS, and of alpha chain of the T-cell receptor, an established substrate of the ER-associated degradation (ERAD) pathway. Surprisingly, RNAi of VCP had no detectable effect on the degradation of two other ERAD substrates, alpha1-antitrypsin and deltaCD3. These results indicate that VCP is required for maintenance of normal ER structure and function and mediates the degradation of some proteins via the UPS, but is dispensable for the UPS-dependent degradation of some ERAD substrates.

Adenosine Triphosphatases↗

Logic of the yeast metabolic cycle: temporal compartmentalization of cellular processes.

Budding yeast grown under continuous, nutrient-limited conditions exhibit robust, highly periodic cycles in the form of respiratory bursts. Microarray studies reveal that over half of the yeast genome is expressed periodically during these metabolic cycles. Genes encoding proteins having a common function exhibit similar temporal expression patterns, and genes specifying functions associated with energy and metabolism tend to be expressed with exceptionally robust periodicity. Essential cellular and metabolic events occur in synchrony with the metabolic cycle, demonstrating that key processes in a simple eukaryotic cell are compartmentalized in time.

Cell Division↗

The crystallographic fast Fourier transform. IV. FFT-asymmetric units in the reciprocal space.

New algorithms have been outlined for efficient calculation of the fast Fourier transform of data revealing crystallographic symmetries in previous papers by Rowicka, Kudlicki & Otwinowski [Acta Cryst. (2002), A58, 574-579; Acta Cryst. (2003), A59, 172-182; Acta Cryst. (2003), A59, 183-192]. The present paper deals with three implementation-related issues, which have not been discussed before. First, the shape of the FFT-asymmetric unit in the reciprocal space is discussed in detail. Next, a method is presented of reducing symmetry in-place, without the need to allocate memory for intermediate results. Finally, there is a discussion on how the algorithm can be used for the inverse Fourier transform. The results are derived for the case of the one-step symmetry reduction [Rowicka, Kudlicki & Otwinowski (2003). Acta Cryst. A59, 172-182]. The algorithms are also an important step in the more complicated cases of centered lattices [Rowicka, Kudlicki & Otwinowski (2003). Acta Cryst. A59, 183-192] and space groups with non-removable special positions, such as cubic groups [Rowicka, Kudlicki & Otwinowski (2004), in preparation]. In the present paper, as in our previous ones, complex-to-complex FFTs only are dealt with. Modifications needed to adapt the results to data with Hermitian symmetry will be described in our forthcoming article [Kudlicki, Rowicka & Otwinowski (2004), in preparation].

Crystallography↗

The crystallographic fast Fourier transform. II. One-step symmetry reduction.

An algorithm for evaluation of the crystallographic FFT for 67 crystallographic space groups is presented. The symmetry is reduced in such a way that it is enough to calculate P1 FFT in the asymmetric unit only and then, in a computationally simpler step, recover the final result. The algorithm yields the maximal symmetry reduction for every space group considered. For the central step in the calculation consisting of general P1 FFTs, any generic fast Fourier subroutine can be used. The approach developed in this paper is an extension of the scheme derived for p3-symmetric data [Rowicka, Kudlicki & Otwinowski (2002). Acta Cryst. A58, 574-579]. Algorithms described here will also be used in our forthcoming papers [Rowicka, Kudlicki & Otwinowski (2003). Acta Cryst A59, 183-192; Rowicka, Kudlicki & Otwinowski (2003), in preparation], where more complicated groups will be considered.

Algorithms↗

The crystallographic fast Fourier transform. III. Centred lattices.

Algorithms for evaluation of the crystallographic FFT for centred lattices are presented. These algorithms can be applied to 80 space groups containing centring operators. For 44 of them, combining these algorithms with those described by Rowicka, Kudlicki & Otwinowski [Acta Cryst A59, 172-182] yields the maximal symmetry reduction. For other groups, new algorithms, to be presented in our forthcoming paper [Rowicka, Kudlicki & Otwinowski (2003), in preparation], are needed. The requirements on the grid size and how they interact with the choice of algorithms are also discussed in detail.

Algorithms↗

The crystallographic fast Fourier transform. I. p3 symmetry.

An algorithm for computing the discrete Fourier transform of data with threefold symmetry axes is presented. This algorithm is straightforward and easily implemented. It reduces the computational complexity of such a Fourier transform by a factor of 3. There are no restrictive requirements imposed on the initial data. Explicit formulae and a scheme of computing the Fourier transform are given. The algorithm has been tested and benchmarked against FFT on the unit cell, revealing the expected increase in speed. This is a non-trivial example of a more general approach developed recently by the authors.

Algorithms↗