Monte Carlo with Absorbing Markov Chains: Fast Local Algorithms for Slow Dynamics

A class of Monte Carlo algorithms which incorporate absorbing Markov chains is presented. In a particular limit, the lowest-order of these algorithms reduces to the $n$-fold way algorithm. These algorithms are applied to study the escape from the metastable state in the two-dimensional square-lattice nearest-neighbor Ising ferromagnet in an unfavorable applied field, and the agreement with theoretical predictions is very good. It is demonstrated that the higher-order algorithms can be many orders of magnitude faster than either the traditional Monte Carlo or $n$-fold way algorithms.Comment: ReVTeX, Request 3 figures from [email protected]

Wang-Landau simulation for the quasi-one-dimensional Ising model

We revisit the nature of the quasi-one-dimensional Ising model on the basis of Wang-Landau simulation. We introduce the density of states in the two-dimensional energy space corresponding to the intra- and inter-chain directions. We then analyze the interchain coupling dependence of the specific heat of the anistropic two-dimensional Ising model in the context of the density of states, and further discuss the size dependences of the peak temperature. We also discuss the feature of the phase transition in the three-dimensional case.Comment: 7 pages, 8 figures, to appear in J. Phys. Soc. Jp

Inferring causal molecular networks: empirical assessment through a community-based effort.

It remains unclear whether causal, rather than merely correlational, relationships in molecular networks can be inferred in complex biological settings. Here we describe the HPN-DREAM network inference challenge, which focused on learning causal influences in signaling networks. We used phosphoprotein data from cancer cell lines as well as in silico data from a nonlinear dynamical model. Using the phosphoprotein data, we scored more than 2,000 networks submitted by challenge participants. The networks spanned 32 biological contexts and were scored in terms of causal validity with respect to unseen interventional data. A number of approaches were effective, and incorporating known biology was generally advantageous. Additional sub-challenges considered time-course prediction and visualization. Our results suggest that learning causal relationships may be feasible in complex settings such as disease states. Furthermore, our scoring approach provides a practical way to empirically assess inferred molecular networks in a causal sense

Inferring causal molecular networks: empirical assessment through a community-based effort

It remains unclear whether causal, rather than merely correlational, relationships in molecular networks can be inferred in complex biological settings. Here we describe the HPN-DREAM network inference challenge, which focused on learning causal influences in signaling networks. We used phosphoprotein data from cancer cell lines as well as in silico data from a nonlinear dynamical model. Using the phosphoprotein data, we scored more than 2,000 networks submitted by challenge participants. The networks spanned 32 biological contexts and were scored in terms of causal validity with respect to unseen interventional data. A number of approaches were effective, and incorporating known biology was generally advantageous. Additional sub-challenges considered time-course prediction and visualization. Our results suggest that learning causal relationships may be feasible in complex settings such as disease states. Furthermore, our scoring approach provides a practical way to empirically assess inferred molecular networks in a causal sense

Inferring causal molecular networks: empirical assessment through a community-based effort

Inferring molecular networks is a central challenge in computational biology. However, it has remained unclear whether causal, rather than merely correlational, relationships can be effectively inferred in complex biological settings. Here we describe the HPN-DREAM network inference challenge that focused on learning causal influences in signaling networks. We used phosphoprotein data from cancer cell lines as well as in silico data from a nonlinear dynamical model. Using the phosphoprotein data, we scored more than 2,000 networks submitted by challenge participants. The networks spanned 32 biological contexts and were scored in terms of causal validity with respect to unseen interventional data. A number of approaches were effective and incorporating known biology was generally advantageous. Additional sub-challenges considered time-course prediction and visualization. Our results constitute the most comprehensive assessment of causal network inference in a mammalian setting carried out to date and suggest that learning causal relationships may be feasible in complex settings such as disease states. Furthermore, our scoring approach provides a practical way to empirically assess the causal validity of inferred molecular networks

Comprehensive Molecular Characterization of Pheochromocytoma and Paraganglioma

SummaryWe report a comprehensive molecular characterization of pheochromocytomas and paragangliomas (PCCs/PGLs), a rare tumor type. Multi-platform integration revealed that PCCs/PGLs are driven by diverse alterations affecting multiple genes and pathways. Pathogenic germline mutations occurred in eight PCC/PGL susceptibility genes. We identified CSDE1 as a somatically mutated driver gene, complementing four known drivers (HRAS, RET, EPAS1, and NF1). We also discovered fusion genes in PCCs/PGLs, involving MAML3, BRAF, NGFR, and NF1. Integrated analysis classified PCCs/PGLs into four molecularly defined groups: a kinase signaling subtype, a pseudohypoxia subtype, a Wnt-altered subtype, driven by MAML3 and CSDE1, and a cortical admixture subtype. Correlates of metastatic PCCs/PGLs included the MAML3 fusion gene. This integrated molecular characterization provides a comprehensive foundation for developing PCC/PGL precision medicine

Integrative molecular characterization of malignant pleural mesothelioma

Malignant pleural mesothelioma (MPM) is a highly lethal cancer of the lining of the chest cavity. To expand our understanding of MPM, we conducted a comprehensive integrated genomic study, including the most detailed analysis of BAP1 alterations to date. We identified histology-independent molecular prognostic subsets, and defined a novel genomic subtype with TP53 and SETDB1 mutations and extensive loss of heterozygosity. We also report strong expression of the immune-checkpoint gene VISTA in epithelioid MPM, strikingly higher than in other solid cancers, with implications for the immune response to MPM and for its immunotherapy. Our findings highlight new avenues for further investigation of MPM biology and novel therapeutic options. SIGNIFICANCE: Through a comprehensive integrated genomic study of 74 MPMs, we provide a deeper understanding of histology-independent determinants of aggressive behavior, define a novel genomic subtype with TP53 and SETDB1 mutations and extensive loss of heterozygosity, and discovered strong expresssion of the immune-checkpoint gene VISTA in epithelioid MPM

Combining heterogeneous data sources for accurate functional annotation of proteins

Combining heterogeneous sources of data is essential for accurate prediction of protein function. The task is complicated by the fact that while sequence-based features can be readily compared across species, most other data are species-specific. In this paper, we present a multi-view extension to GOstruct, a structured-output framework for function annotation of proteins. The extended framework can learn from disparate data sources, with each data source provided to the framework in the form of a kernel. Our empirical results demonstrate that the multi-view framework is able to utilize all available information, yielding better performance than sequence-based models trained across species and models trained from collections of data within a given species. This version of GOstruct participated in the recent Critical Assessment of Functional Annotations (CAFA) challenge; since then we have significantly improved the natural language processing component of the method, which now provides performance that is on par with that provided by sequence information. The GOstruct framework is available for download at http://strut.sourceforge.net

The model student: GPT-4 performance on graduate biomedical science exams

Abstract The GPT-4 large language model (LLM) and ChatGPT chatbot have emerged as accessible and capable tools for generating English-language text in a variety of formats. GPT-4 has previously performed well when applied to questions from multiple standardized examinations. However, further evaluation of trustworthiness and accuracy of GPT-4 responses across various knowledge domains is essential before its use as a reference resource. Here, we assess GPT-4 performance on nine graduate-level examinations in the biomedical sciences (seven blinded), finding that GPT-4 scores exceed the student average in seven of nine cases and exceed all student scores for four exams. GPT-4 performed very well on fill-in-the-blank, short-answer, and essay questions, and correctly answered several questions on figures sourced from published manuscripts. Conversely, GPT-4 performed poorly on questions with figures containing simulated data and those requiring a hand-drawn answer. Two GPT-4 answer-sets were flagged as plagiarism based on answer similarity and some model responses included detailed hallucinations. In addition to assessing GPT-4 performance, we discuss patterns and limitations in GPT-4 capabilities with the goal of informing design of future academic examinations in the chatbot era