PubMed Health⌕ Search

Biomedical subjects

J P Chevrolat

Publications and source records attributed to J P Chevrolat.

4 recordsLinked to original sources

Hidden Markov model approach for identifying the modular framework of the protein backbone.

The hidden Markov model (HMM) was used to identify recurrent short 3D structural building blocks (SBBs) describing protein backbones, independently of any a priori knowledge. Polypeptide chains are decomposed into a series of short segments defined by their inter-alpha-carbon distances. Basically, the model takes into account the sequentiality of the observed segments and assumes that each one corresponds to one of several possible SBBs. Fitting the model to a database of non-redundant proteins allowed us to decode proteins in terms of 12 distinct SBBs with different roles in protein structure. Some SBBs correspond to classical regular secondary structures. Others correspond to a significant subdivision of their bounding regions previously considered to be a single pattern. The major contribution of the HMM is that this model implicitly takes into account the sequential connections between SBBs and thus describes the most probable pathways by which the blocks are connected to form the framework of the protein structures. Validation of the SBBs code was performed by extracting SBB series repeated in recoding proteins and examining their structural similarities. Preliminary results on the sequence specificity of SBBs suggest promising perspectives for the prediction of SBBs or series of SBBs from the protein sequences.

Amino Acid Sequence↗

Modelling behavioral syndromes using Bayesian networks.

In this paper Bayesian networks modelling is applied to a multidimensional model of depression. The characterization of the probabilistic model exploits expert knowledge to associate latent concentrations of neurotransmitters and symptoms. An evolution perspective is also considered. Specific criteria are introduced to detect the influence of the latent variable on the observation of symptoms. The Bayesian analysis is carried out using Gibbs sampling technique which is implemented in the BUGS software. The estimation phase leads to the selection of symptoms entering into the definition of behavioral syndromes. Results on real data are discussed. The last section deals with simulation experiments. Simulation results confirm our methodological choices. Results of the paper can enlarge to the central problem of the management of latent variables in Bayesian networks modelling.

Artificial Intelligence↗

A strategy for finding regions of similarity in complete genome sequences.

MOTIVATION: Complete genomic sequences will become available in the future. New methods to deal with very large sequences (sizes beyond 100 kb) efficiently are required. One of the main aims of such work is to increase our understanding of genome organization and evolution. This requires studies of the locations of regions of similarity. RESULTS: We present here a new tool, ASSIRC ('Accelerated Search for SImilarity Regions in Chromosomes'), for finding regions of similarity in genomic sequences. The method involves three steps: (i) identification of short exact chains of fixed size, called 'seeds', common to both sequences, using hashing functions; (ii) extension of these seeds into putative regions of similarity by a 'random walk' procedure; (iii) final selection of regions of similarity by assessing alignments of the putative sequences. We used simulations to estimate the proportion of regions of similarity not detected for particular region sizes, base identity proportions and seed sizes. This approach can be tailored to the user's specifications. We looked for regions of similarity between two yeast chromosomes (V and IX). The efficiency of the approach was compared to those of conventional programs BLAST and FASTA, by assessing CPU time required and the regions of similarity found for the same data set. AVAILABILITY: Source programs are freely available at the following address: ftp://ftp.biologie.ens. fr/pub/molbio/assirc.tar.gz CONTACT: vincens@biologie.ens.fr, hazout@urbb.jussieu.fr

Algorithms↗

Mixed Bayesian networks: a mixture of Gaussian distributions.

Mixed Bayesian networks are probabilistic models associated with a graphical representation, where the graph is directed and the random variables are discrete or continuous. We propose a comprehensive method for estimating the density functions of continuous variables, using a graph structure and a set of samples. The principle of the method is to learn the shape of densities from a sample of continuous variables. The densities are approximated by a mixture of Gaussian distributions. The estimation algorithm is a stochastic version of the Expectation Maximization algorithm (Stochastic EM algorithm). The inference algorithm corresponding to our model is a variant of junction three method, adapted to our specific case. The approach is illustrated by a simulated example from the domain of pharmacokinetics. Tests show that the true distributions seem sufficiently fitted for practical application.

Algorithms↗