Bayesian Networks have been used for the inference of transcriptional regulatory relationships among genes, and are valuable for obtaining biological insights. However, finding optimal Bayesian Network (BN) is NP-hard. Thus, heuristic approaches have sought to effectively solve this problem. In this work, we develop a hybrid search method combining Simulated Annealing with a Greedy Algorithm (SAGA). SAGA explores most of the search space by undergoing a two-phase search: first with a Simulated Annealing search and then with a Greedy search. Three sets of background-corrected and normalized microarray datasets were used to test the algorithm. BN structure learning was also conducted using the datasets, and other established search methods as implemented in BANJO (Bayesian Network Inference with Java Objects). The Bayesian Dirichlet Equivalence (BDe) metric was used to score the networks produced with SAGA. SAGA predicted transcriptional regulatory relationships among genes in networks that evaluated to higher BDe scores with high sensitivities and specificities. Thus, the proposed method competes well with existing search algorithms for Bayesian Network structure learning of transcriptional regulatory networks.

Breast cancer prognosis and administration of therapies are aided by knowledge of hormonal and HER2 receptor status. Breast cancer lacking estrogen receptors, progesterone receptors and HER2 receptors are difficult to treat. Regarding large data repositories such as The Cancer Genome Atlas, available wet-lab methods for establishing the presence of these receptors do not always conclusively cover all available samples. To this end, we introduce median-supplement methods to identify hormonal and HER2 receptor status phenotypes of breast cancer patients using gene expression profiles. In these approaches, supplementary instances based on median patient gene expression are introduced to balance a training set from which we build simple models to identify the receptor expression status of patients. In addition, for the purpose of benchmarking, we examine major machine learning approaches that are also applicable to the problem of finding receptor status in breast cancer. We show that our methods are robust and have high sensitivity with extremely low false-positive rates compared with the well-established methods. A successful application of these methods will permit the simultaneous study of large collections of samples of breast cancer patients as well as save time and cost while standardizing interpretation of outcomes of such studies.

No abstract

Antigenic variations of influenza A viruses are induced by genomic mutation in their trans-membrane protein HA1, eliciting viral escape from neutralization by antibodies generated in prior infections or vaccinations. Prediction of antigenic relationships among influenza viruses is useful for designing (or updating the existing) influenza vaccines, provides important insights into the evolutionary mechanisms underpinning viral antigenic variations, and helps to understand viral epidemiology. In this study, we present a simple and physically interpretable model that can predict antigenic relationships among influenza A viruses, based on biophysical ideas, using both genomic amino acid sequences and experimental antigenic data. We demonstrate the applicability of the model using a benchmark dataset of four subtypes of influenza A (H1N1, H3N2, H5N1, and H9N2) viruses and report on its performance profiles. Additionally, analysis of the model’s parameters confirms several observations that are consistent with the findings of other previous studies, for which we provide plausible explanations.

No abstract