Dataset Information

Algorithms for incorporating prior topological information in HMMs: application to transmembrane proteins.

ABSTRACT: BACKGROUND: Hidden Markov Models (HMMs) have been extensively used in computational molecular biology, for modelling protein and nucleic acid sequences. In many applications, such as transmembrane protein topology prediction, the incorporation of limited amount of information regarding the topology, arising from biochemical experiments, has been proved a very useful strategy that increased remarkably the performance of even the top-scoring methods. However, no clear and formal explanation of the algorithms that retains the probabilistic interpretation of the models has been presented so far in the literature. RESULTS: We present here, a simple method that allows incorporation of prior topological information concerning the sequences at hand, while at the same time the HMMs retain their full probabilistic interpretation in terms of conditional probabilities. We present modifications to the standard Forward and Backward algorithms of HMMs and we also show explicitly, how reliable predictions may arise by these modifications, using all the algorithms currently available for decoding HMMs. A similar procedure may be used in the training procedure, aiming at optimizing the labels of the HMM's classes, especially in cases such as transmembrane proteins where the labels of the membrane-spanning segments are inherently misplaced. We present an application of this approach developing a method to predict the transmembrane regions of alpha-helical membrane proteins, trained on crystallographically solved data. We show that this method compares well against already established algorithms presented in the literature, and it is extremely useful in practical applications. CONCLUSION: The algorithms presented here, are easily implemented in any kind of a Hidden Markov Model, whereas the prediction method (HMM-TM) is freely available for academic users at http://bioinformatics.biol.uoa.gr/HMM-TM, offering the most advanced decoding options currently available.

SUBMITTER: Bagos PG

PROVIDER: S-EPMC1523218 | biostudies-literature | 2006

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Algorithms for incorporating prior topological information in HMMs: application to transmembrane proteins.

Bagos Pantelis G PG Liakopoulos Theodore D TD Hamodrakas Stavros J SJ

BMC bioinformatics 20060405

<h4>Background</h4>Hidden Markov Models (HMMs) have been extensively used in computational molecular biology, for modelling protein and nucleic acid sequences. In many applications, such as transmembrane protein topology prediction, the incorporation of limited amount of information regarding the topology, arising from biochemical experiments, has been proved a very useful strategy that increased remarkably the performance of even the top-scoring methods. However, no clear and formal explanation ...[more]

PMID: 16597327

Similar Datasets

Project description:IntroductionMutations in BRCA1 and BRCA2 confer high risks of breast cancer and ovarian cancer. The risk prediction algorithm BOADICEA (Breast and Ovarian Analysis of Disease Incidence and Carrier Estimation Algorithm) may be used to compute the probabilities of carrying mutations in BRCA1 and BRCA2 and help to target mutation screening. Tumours from BRCA1 and BRCA2 mutation carriers display distinctive pathological features that could be used to better discriminate between BRCA1 mutation carriers, BRCA2 mutation carriers and noncarriers. In particular, oestrogen receptor (ER)-negative status, triple-negative (TN) status, and expression of basal markers are predictive of BRCA1 mutation carrier status.MethodsWe extended BOADICEA by treating breast cancer subtypes as distinct disease end points. Age-specific expression of phenotypic markers in a series of tumours from 182 BRCA1 mutation carriers, 62 BRCA2 mutation carriers and 109 controls from the Breast Cancer Linkage Consortium, and over 300,000 tumours from the general population obtained from the Surveillance Epidemiology, and End Results database, were used to calculate age-specific and genotype-specific incidences of each disease end point. The probability that an individual carries a BRCA1 or BRCA2 mutation given their family history and tumour marker status of family members was computed in sample pedigrees.ResultsThe cumulative risk of ER-negative breast cancer by age 70 for BRCA1 mutation carriers was estimated to be 55% and the risk of ER-positive disease was 18%. The corresponding risks for BRCA2 mutation carriers were 21% and 44% for ER-negative and ER-positive disease, respectively. The predicted BRCA1 carrier probabilities among ER-positive breast cancer cases were less than 1% at all ages. For women diagnosed with breast cancer below age 50 years, these probabilities rose to more than 5% in ER-negative breast cancer, 7% in TN disease and 24% in TN breast cancer expressing both CK5/6 and CK14 cytokeratins. Large differences in mutation probabilities were observed by combining ER status and other informative markers with family history.ConclusionsThis approach combines both full pedigree and tumour subtype data to predict BRCA1/2 carrier probabilities. Prediction of BRCA1/2 carrier status, and hence selection of women for mutation screening, may be substantially improved by combining tumour pathology with family history of cancer.

Project description:BACKGROUND:Discovering robust markers for cancer prognosis based on gene expression data is an important yet challenging problem in translational bioinformatics. By integrating additional information in biological pathways or a protein-protein interaction (PPI) network, we can find better biomarkers that lead to more accurate and reproducible prognostic predictions. In fact, recent studies have shown that, "modular markers," that integrate multiple genes with potential interactions can improve disease classification and also provide better understanding of the disease mechanisms. RESULTS:In this work, we propose a novel algorithm for finding robust and effective subnetwork markers that can accurately predict cancer prognosis. To simultaneously discover multiple synergistic subnetwork markers in a human PPI network, we build on our previous work that uses affinity propagation, an efficient clustering algorithm based on a message-passing scheme. Using affinity propagation, we identify potential subnetwork markers that consist of discriminative genes that display coherent expression patterns and whose protein products are closely located on the PPI network. Furthermore, we incorporate the topological information from the PPI network to evaluate the potential of a given set of proteins to be involved in a functional module. Primarily, we adopt widely made assumptions that densely connected subnetworks may likely be potential functional modules and that proteins that are not directly connected but interact with similar sets of other proteins may share similar functionalities. CONCLUSIONS:Incorporating topological attributes based on these assumptions can enhance the prediction of potential subnetwork markers. We evaluate the performance of the proposed subnetwork marker identification method by performing classification experiments using multiple independent breast cancer gene expression datasets and PPI networks. We show that our method leads to the discovery of robust subnetwork markers that can improve cancer classification.

Dataset Information

Algorithms for incorporating prior topological information in HMMs: application to transmembrane proteins.

Publications

Algorithms for incorporating prior topological information in HMMs: application to transmembrane proteins.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets