Biomedical subjects

Jens Kleinjung

Publications and source records attributed to Jens Kleinjung.

4 recordsLinked to original sources

PubMed2003

POPS: A fast algorithm for solvent accessible surface areas at atomic and residue level.

POPS (Parameter OPtimsed Surfaces) is a new method to calculate solvent accessible surface areas, which is based on an empirically parameterisable analytical formula and fast to compute. Atomic and residue areas (the latter represented by a single sphere centered on the C(alpha) atom of amino acids and at the P atom of nucleotides) have been optimised versus accurate all-atom methods. The parameterisation has been derived from a selected dataset of proteins and nucleic acids of different sizes and topologies. The residue based approach POPS-R, has been devised as a useful tool for the analysis of large macromolecular assemblies like the ribosome and it is specially suited for the refinement of low resolution structures. POPS-R also allows for estimates of the loss of free energy of solvation upon complex formation, which should be particularly useful for the design of new protein-protein and protein-nucleic acid complexes. The program POPS is available at http://mathbio.nimr.mrc.ac.uk/~ffranca/POPS and at the mirror site http://www.cs.vu.nl/~ibivu/programs/popswww.

Algorithms↗

PubMed2003

Thermal unfolding simulations of apo-calmodulin using leap-dynamics.

The simulation method leap-dynamics (LD) has been applied to protein thermal unfolding simulations to investigate domain-specific unfolding behavior. Thermal unfolding simulations of the 148-residue protein apo-calmodulin with implicit solvent were performed at temperatures 290 K, 325 K, and 360 K and compared with the corresponding molecular dynamics trajectories in terms of a number of calculated conformational parameters. The main experimental results of unfolding are reproduced in showing the lower stability of the C-domain: at 290 K, both the N- and C-domains are essentially stable; at 325 K, the C-domain unfolds, whereas the N-domain remains folded; and at 360 K, both domains unfold extensively. This behavior could not be reproduced by molecular dynamics simulations alone under the same conditions. These results show an encouraging degree of convergence between experiment and LD simulation. The simulations are able to describe the overall plasticity of the apo-calmodulin structure and to reveal details such as reversible folding/unfolding events within single helices. The results show that by using the combined application of a fast and efficient sampling routine with a detailed molecular dynamics force field, unfolding simulations of proteins at atomic resolution are within the scope of current computational power.

Apoproteins↗

PubMed2003

Testing homology with Contact Accepted mutatiOn (CAO): a contact-based Markov model of protein evolution.

Point Accepted Mutation (PAM) is the Markov model of amino acid replacements in proteins introduced by Dayhoff and her co-workers (Dayhoff et al., 1978). The PAM matrices and other matrices based on the PAM model have been widely accepted as the standard scoring system of protein sequence similarity in protein sequence alignment tools. Here, we present Contact Accepted mutatiOn (CAO), a Markov model of protein residue contact mutations. The CAO model simulates the interchanging of structurally defined side-chain contacts, and introduces additional structural information into protein sequence alignments. Therefore, similarities between structurally conserved sequences can be detected even without apparent sequence similarity. CAO has been benchmarked on the HOMSTRAD database and a subset of the CATH database, by comparing sequence alignments with reference alignments derived from structural superposition. CAO yields scores that reflect coherently the structural quality of sequence alignments, which has implications particularly for homology modelling and threading techniques.

Amino Acid Sequence↗

PubMed2002

Parallelized multiple alignment.

UNLABELLED: Multiple sequence alignment is a frequently used technique for analyzing sequence relationships. Compilation of large alignments is computationally expensive, but processing time can be considerably reduced when the computational load is distributed over many processors. Parallel processing functionality in the form of single-instruction multiple-data (SIMD) technology was implemented into the multiple alignment program Praline by using 'message passing interface' (MPI) routines. Over the alignments tested here, the parallelized program performed up to ten times faster on 25 processors compared to the single processor version. AVAILABILITY: Example program code for parallelizing pairwise alignment loops is available from http://mathbio.nimr.mrc.ac.uk/~jkleinj/tools/mpicode. The 'message passing interface' package (MPICH) is available from http:/www.unix.mcs.anl.gov/mpi/mpich. CONTACT: jhering@nimr.mrc.ac.uk SUPPLEMENTARY INFORMATION: Praline is accessible at http://mathbio.nimr.mrc.ac.uk/praline.

Algorithms↗