Search PubMed⌕ Search

Biomedical subjects

S Posch

Publications and source records attributed to S Posch.

4 recordsLinked to original sources

Identification of transcription factor binding sites with variable-order Bayesian networks.

MOTIVATION: We propose a new class of variable-order Bayesian network (VOBN) models for the identification of transcription factor binding sites (TFBSs). The proposed models generalize the widely used position weight matrix (PWM) models, Markov models and Bayesian network models. In contrast to these models, where for each position a fixed subset of the remaining positions is used to model dependencies, in VOBN models, these subsets may vary based on the specific nucleotides observed, which are called the context. This flexibility turns out to be of advantage for the classification and analysis of TFBSs, as statistical dependencies between nucleotides in different TFBS positions (not necessarily adjacent) may be taken into account efficiently--in a position-specific and context-specific manner. RESULTS: We apply the VOBN model to a set of 238 experimentally verified sigma-70 binding sites in Escherichia coli. We find that the VOBN model can distinguish these 238 sites from a set of 472 intergenic 'non-promoter' sequences with a higher accuracy than fixed-order Markov models or Bayesian trees. We use a replicated stratified-holdout experiment having a fixed true-negative rate of 99.9%. We find that for a foreground inhomogeneous VOBN model of order 1 and a background homogeneous variable-order Markov (VOM) model of order 5, the obtained mean true-positive (TP) rate is 47.56%. In comparison, the best TP rate for the conventional models is 44.39%, obtained from a foreground PWM model and a background 2nd-order Markov model. As the standard deviation of the estimated TP rate is approximately 0.01%, this improvement is highly significant.

Algorithms↗

Estimation and filtering of potential protein-protein docking positions.

MOTIVATION: Software systems predicting automatically whether and how two proteins may interact are highly desirable, both for understanding biological processes and for the rational design of new proteins. As a part of a future complete solution to this problem, a bundle of programs is presented designed (i) to estimate initial docking positions for a given pair of docking candidates, (ii) to adjust them, and (iii) to filter them, thus preparing more detailed computations of free energies. RESULTS: The system is evaluated on a test set of 51 co-crystallized complexes aiming at redocking the subunits. It works completely automatically and the evaluation is performed using one single set of parameters for all complexes in the test set. The number of solutions is fixed to 50 positions with a median CPU time of 26 min. For 30 complexes, these contain a near-correct solution with root mean square deviation ( RMSD ) </=5.0 A, which is ranked first in five cases. For all complexes, the best solution is scored on rank 16 as the worst case, and has a median RMSD of 4.3 A. Alternatively to this initial estimation of docking positions, a global sampling of rotations was tested. Whereas this yields top-ranked solutions with RMSD </=3.0 A for all 51 complexes, the median CPU time increases to 11 h. This shows that this blind sampling is not feasible for most applications. AVAILABILITY: The system and its components are available on request from the authors. CONTACT: friedric@techfak.uni-bielefeld or posch@techfak.uni-bielefeld.de

Algorithms↗

viwish: a visualization server for protein modelling and docking.

A visualization tool viwish for proteins based on the Tcl command language has been developed. The system is completely menu driven and can display arbitrary many proteins in arbitrary many windows. It isinstantly t o use, even for non computer experts and provides possibilities to modify menus, configurations, and windows. It may be used as a stand-alone molecular graphics package or as a graphics server for external programs. Communications with these client applications is established even across different machines (through the send command to Tk, an extension of Tcl). In addition, a wide rage of chemical data like molecular surfaces and 3D gridded samplings of chemical features can be displayed. Therefore the systmen is especially useful for the development of algorithms that need visual distributed freely, including the source code.

Binding Sites↗

Protein docking combining symbolic descriptions of molecular surfaces and grid-based scoring functions.

With the growing number of known 3D protein structures, computing systems, that can predict where two protein molecules interact with each other is becoming of increasing interest. A system is presented, integrating preprocessing like the computation of molecular surfaces, segmentation, and searching for complementarity in the general framework of a pattern analyzing semantic network (ERNEST). The score of coarse symbolic computations is used by the problem independent control strategy of ERNEST to guide a more detailed analysis considering steric clash and judgements based on grid-based surface representations. Successful examples of the docking system are discussed that compare well with other approaches.

Binding Sites↗