基于人类信号网络和表达谱数据挖掘动脉粥样硬化相关模块

目的:动脉粥样硬化是一种高致死率的慢性炎症疾病,其发生和发展的机制尚不明确。本文基于人类信号网络和基因表达谱数据对动脉粥样硬化相关模块进行挖掘,以探究其在疾病发生发展中的作用机制。方法:结合人类信号网络和基因表达谱数据,设计显著差异模块筛选策略,通过功能分析,挖掘动脉粥样硬化相关模块,对动脉粥样硬化的致病机制进行研究。结果:基于网络模块的平均表达值改变量,采用两种随机方法,进行显著差异模块筛选,最终获得8个动脉粥样硬化相关的显著差异模块。结论:应用本文提出的整合筛选策略,能识别与动脉粥样硬化相关的模块,获得潜在的致病基因,并从外周血的基因表达改变来探究动脉粥样硬化致病机制,这对动脉粥样硬化的诊断、治疗以及发生发展机制的研究具有重要意义。     

基于扩展起始节点和加权融合策略预测肺癌风险致病基因

肺癌风险致病基因预测有助于了解疾病发病机制、提高临床治疗效果.目前,以重启游走为框架的风险致病基因预测算法,普遍存在起始节点少、节点转移概率相同、信息源单一的问题.为此,本文提出一种基于扩展起始节点和加权融合策略的风险致病基因预测算法(命名为AFMFSC),并在肺癌中验证算法有效性.首先,基于增广模糊测量思想,计算疾病表型近似基因间的增广功能相似得分,从中选出重要基因与致病基因作为扩展起始节点;其次,采用节点拓扑相似度转移矩阵及基因表达差异相关性转移矩阵,分别在蛋白质网络中重启随机游走,并将两种结果加权融合排序;最后,通过富集分析排名靠前基因,得到有显著意义的风险致病基因.AFMFSC算法预测的73个肺癌风险致病基因,均与肺癌发生、发展有密切联系,生物学意义显著.与其他排序算法相比,AFMFSC算法的Top 1%、Top 5%和AUC值比较大,平均排名和受拓扑特性偏差影响程度小;融合策略排名性能优于单一转移矩阵或普通邻接矩阵游走排名.AFMFSC算法不仅能准确有效地预测肺癌风险致病基因,而且可推广预测其他疾病风险致病基因,为探索癌症致病机理提供新视角及依据.     

随机矩阵理论在肝癌基因功能模块识别中的应用

采用随机矩阵理论方法研究了肝癌的基因表达网络。通过标准误差分析,得到了从富含噪声的肝癌基因网络中分离出真实肝癌基因网络的、去躁最充分的关联系数,分析了由此获得的基因表达网络的13个基因功能模块,发现这些模块与肝癌的产生和发展有密切关系。基于随机矩阵理论的方法克服了以往模块识别方法带有主观因素且不能去除噪声因子的缺陷,是一种有效去除随机噪声、识别基因模块、简化基因网络的方法。由于基因数目的众多及细胞生物过程的复杂性,从整体的角度系统研究肝癌基因表达谱,对理解肝癌分子机制和探索新的治疗方法有重要的现实意义。     

基于随机游走的风险致病基因预测研究进展

风险致病基因预测有助于揭示癌症等复杂疾病发生、发展机理,提高现有复杂疾病检测、预防及治疗水平,为药物设计提供靶标.全基因组关联分析(GWAS)和连锁分析等传统方法通常会产生数百种候选致病基因,采用生物实验方法进一步验证这些候选致病基因往往成本高、费时费力,而通过计算方法预测风险致病基因,并对其进行排序,可有效减少候选致病基因数量,帮助生物学家优化实验验证方案.鉴于目前随机游走算法在风险致病基因预测方面的卓越表现,本文从单元分子网络、多重分子网络和异构分子网络出发,对基于随机游走预测风险致病基因研究进展进行较全面的综述分析,讨论其所存在的计算问题,展望未来可能的研究方向.     

与实验条件相关的基因功能模块聚类分析方法

针对细胞内基因功能模块化的现象,定义了“基因功能模块”和“特征功能模块”两个概念,并基于这两个概念提出一种“与实验条件相关的基因功能模块聚类算法”。该算法综合利用基因功能知识与基因表达谱信息,将基因聚类为与实验条件相关的基因功能模块。向基因表达谱中加入水平逐渐升高的数据噪音,根据基因功能模块对数据噪音的抵抗力,确定最稳定的基因功能模块,即特征功能模块。加噪音实验显示,在基因芯片技术可能发生的噪音范围内,该算法对噪音的稳健性优于层次聚类和模糊C均值聚类。将模块聚类算法应用在NCI60数据集上,发现了8个与实验条件高度相关的特征功能模块。     

基于功能一致性预测冠心病致病基因

目的:为了解疾病致病机理和改进临床治疗,基于功能一致性挖掘潜在的疾病致病基因.方法:本文基于功能一致性基因的共定位特性,结合蛋白质互作网络拓扑结构,获取疾病候选基因集,并通过GO及KEGG功能富集分析方法进一步筛选,预测出新的致病基因.结果:挖掘得到的59个冠心病致病基因通过文献证实绝大部分基因与疾病的发生发展存在着联系.结论:本方法具有可行性,研究者能够在此基础上很好地进行疾病致病机理的研究.     

基于基因表达谱的疾病亚型特征基因挖掘方法

在本研究中,提出了一种基于基因表达谱的疾病亚型特征基因挖掘方法,该方法基于过滤后基因表达谱,融合无监督聚类识别疾病亚型技术和提出的衡量特征基因对疾病亚型鉴别能力的模式质量测度,以嵌入的方式实现特征基因挖掘。最后将提出的方法应用于40例结肠癌组织与22例正常结肠组织中2000个基因的表达谱实验数据,结果显示:提出的方法是一种可行的疾病亚型特征基因挖掘方法,方法的优势在于可并行实现疾病亚型划分和特征基因识别。     

复杂疾病驱使的融合SDA-SVM集成基因挖掘方法

提出了一种新颖的复杂疾病驱使的融合SDA-SVM(Stepwise Discriminant Analysis-Support Vector Machine,SDA-SVM)技术的集成基因挖掘方法。该集成方法融合逐步判别分析和支持向量机的优点,能够有效地进行复杂疾病相关基因的深度挖掘,使得挖掘出的基因能够较好地识别疾病类型和亚型。通过将该方法应用于一套弥散性大B细胞淋巴瘤DNA表达谱数据,并与其它基因挖掘方法对比,结果表明该方法挖掘出的基因具有较高的疾病相关性和较强的疾病类型识别能力。     

基于miRNA-mRNA联合分析的卵巢癌调控网络构建

研究表明微小RNA(microRNA,miRNA)通过影响转录后基因表达来调节机体功能,并与肿瘤的发生有密切关系。然而目前癌症致病过程的转录调控网络重构大多致力于转录层面的基因表达数据的处理和分析,如何整合转录及转录后不同类型的生物数据以挖掘它们的共调控机制是目前的研究热点之一。基于此,本研究利用联合非负矩阵分解算法融合卵巢癌miRNA数据和基因表达数据形成共模块,其次对特征模块中miRNA的靶基因进行预测分析,最后对mi RNA-mRNA共模块进行转录及转录后共调控网络构建。仿真结果及分子生物学分析表明,通过联合矩阵分析方法所提取的共模块显示出了与卵巢癌致病具有显著的生物相关性和潜在的联系,此外,GO生物过程分析也进一步的揭示了所提取的共模块中miRNA靶基因的生物学功能与卵巢癌致病密切相关。     

基于共进化基因功能模块发现候选癌基因

癌基因组的体细胞突变扫查数据为研究人员发现新的癌基因提供了大量的信息。已有的通过基因突变频率寻找候选癌基因的方法倾向于发现突变频率较高的癌基因,但是部分低频率突变的基因也可能在癌症发生过程中发挥重要作用。具有相似系统发生谱并且具有蛋白互作关系的基因可能具有相似的功能,它们的损伤可能会导致相同或相似的疾病表型。基于这一假设,文章提出了一种发现候选癌基因的新方法。首先,寻找具有相似系统发生谱的蛋白质互作子网,定义为共进化基因模块;然后,在癌基因组中发生至少一次非同义体细胞突变的基因中,筛选出与已知癌基因在同一共进化模块并具有直接相互作用的基因,预测为候选癌基因。据此,文章共预测了15个候选癌基因,其中只有2个基因在以往的工作中通过基于高突变频率的方法被识别为癌基因。因此,该方法可以有效地发现突变频率低的候选癌基因。     

Global risk transformative prioritization for prostate cancer candidate genes in molecular networks

Understanding the pathogenesis of complex diseases is aided by precise identification of the genes responsible. Many computational methods have been developed to prioritize candidate disease genes, but coverage of functional annotations may be a limiting factor for most of these methods. Here, we introduce a global candidate gene prioritization approach that considers information about network properties in the human protein interaction network and risk transformative contents from known disease genes. Global risk transformative scores were then used to prioritize candidate genes. This method was introduced to prioritize candidate genes for prostate cancer. The effectiveness of our global risk transformative algorithm for prioritizing candidate genes was evaluated according to validation studies. Compared with ToppGene and random walk-based methods, our method outperformed the two other candidate gene prioritization methods. The generality of our method was assessed by testing it on prostate cancer and other types of cancer. The performance was evaluated using standard leave-one-out cross-validation.     

Candidate gene prioritization

Candidate gene identification is typically labour intensive, involving laboratory experiments required to corroborate or disprove any hypothesis for a nominated candidate gene being considered the causative gene. The traditional approach to reduce the number of candidate genes entails fine-mapping studies using markers and pedigrees. Gene prioritization establishes the ranking of candidate genes based on their relevance to the biological process of interest, from which the most promising genes can be selected for further analysis. To date, many computational methods have focused on the prediction of candidate genes by analysis of their inherent sequence characteristics and similarity with respect to known disease genes, as well as their functional annotation. In the last decade, several computational tools for prioritizing candidate genes have been proposed. A large number of them are web-based tools, while others are standalone applications that install and run locally. This review attempts to take a close look at gene prioritization criteria, as well as candidate gene prioritization algorithms, and thus provide a comprehensive synopsis of the subject matter.     

CGI: a new approach for prioritizing genes by combining gene expression and protein-protein interaction data

MOTIVATION: Identifying candidate genes associated with a given phenotype or trait is an important problem in biological and biomedical studies. Prioritizing genes based on the accumulated information from several data sources is of fundamental importance. Several integrative methods have been developed when a set of candidate genes for the phenotype is available. However, how to prioritize genes for phenotypes when no candidates are available is still a challenging problem. RESULTS: We develop a new method for prioritizing genes associated with a phenotype by Combining Gene expression and protein Interaction data (CGI). The method is applied to yeast gene expression data sets in combination with protein interaction data sets of varying reliability. We found that our method outperforms the intuitive prioritizing method of using either gene expression data or protein interaction data only and a recent gene ranking algorithm GeneRank. We then apply our method to prioritize genes for Alzheimer's disease. AVAILABILITY: The code in this paper is available upon request.     

Gene gravity-like algorithm for disease gene prediction based on phenotype-specific network

Background

Polygenic diseases are usually caused by the dysfunction of multiple genes. Unravelling such disease genes is crucial to fully understand the genetic landscape of diseases on molecular level. With the advent of ‘omic’ data era, network-based methods have prominently boosted disease gene discovery. However, how to make better use of different types of data for the prediction of disease genes remains a challenge.

Results

In this study, we improved the performance of disease gene prediction by integrating the similarity of disease phenotype, biological function and network topology. First, for each phenotype, a phenotype-specific network was specially constructed by mapping phenotype similarity information of given phenotype onto the protein-protein interaction (PPI) network. Then, we developed a gene gravity-like algorithm, to score candidate genes based on not only topological similarity but also functional similarity. We tested the proposed network and algorithm by conducting leave-one-out and leave-10%-out cross validation and compared them with state-of-art algorithms. The results showed a preference to phenotype-specific network as well as gene gravity-like algorithm. At last, we tested the predicting capacity of proposed algorithms by test gene set derived from the DisGeNET database. Also, potential disease genes of three polygenic diseases, obesity, prostate cancer and lung cancer, were predicted by proposed methods. We found that the predicted disease genes are highly consistent with literature and database evidence.

Conclusions

The good performance of phenotype-specific networks indicates that phenotype similarity information has positive effect on the prediction of disease genes. The proposed gene gravity-like algorithm outperforms the algorithm of Random Walk with Restart (RWR), implicating its predicting capacity by combing topological similarity with functional similarity. Our work will give an insight to the discovery of disease genes by fusing multiple similarities of genes and diseases.

     

Inference of disease-related molecular logic from systems-based microarray analysis

Computational analysis of gene expression data from microarrays has been useful for medical diagnosis and prognosis. The ability to analyze such data at the level of biological modules, rather than individual genes, has been recognized as important for improving our understanding of disease-related pathways. It has proved difficult, however, to infer pathways from microarray data by deriving modules of multiple synergistically interrelated genes, rather than individual genes. Here we propose a systems-based approach called Entropy Minimization and Boolean Parsimony (EMBP) that identifies, directly from gene expression data, modules of genes that are jointly associated with disease. Furthermore, the technique provides insight into the underlying biomolecular logic by inferring a logic function connecting the joint expression levels in a gene module with the outcome of disease. Coupled with biological knowledge, this information can be useful for identifying disease-related pathways, suggesting potential therapeutic approaches for interfering with the functions of such pathways. We present an example providing such gene modules associated with prostate cancer from publicly available gene expression data, and we successfully validate the results on additional independently derived data. Our results indicate a link between prostate cancer and cellular damage from oxidative stress combined with inhibition of apoptotic mechanisms normally triggered by such damage.     

Functional impact bias reveals cancer drivers

Identifying cancer driver genes and pathways among all somatic mutations detected in a cohort of tumors is a key challenge in cancer genomics. Traditionally, this is done by prioritizing genes according to the recurrence of alterations that they bear. However, this approach has some known limitations, such as the difficulty to correctly estimate the background mutation rate, and the fact that it cannot identify lowly recurrently mutated driver genes. Here we present a novel approach, Oncodrive-fm, to detect candidate cancer drivers which does not rely on recurrence. First, we hypothesized that any bias toward the accumulation of variants with high functional impact observed in a gene or group of genes may be an indication of positive selection and can thus be used to detect candidate driver genes or gene modules. Next, we developed a method to measure this bias (FM bias) and applied it to three datasets of tumor somatic variants. As a proof of concept of our hypothesis we show that most of the highly recurrent and well-known cancer genes exhibit a clear FM bias. Moreover, this novel approach avoids some known limitations of recurrence-based approaches, and can successfully identify lowly recurrent candidate cancer drivers.     

A Systems Genetics Approach Identifies CXCL14, ITGAX,and LPCAT2 as Novel Aggressive Prostate Cancer Susceptibility Genes

Although prostate cancer typically runs an indolent course, a subset of men develop aggressive, fatal forms of this disease. We hypothesize that germline variation modulates susceptibility to aggressive prostate cancer. The goal of this work is to identify susceptibility genes using the C57BL/6-Tg(TRAMP)8247Ng/J (TRAMP) mouse model of neuroendocrine prostate cancer. Quantitative trait locus (QTL) mapping was performed in transgene-positive (TRAMPxNOD/ShiLtJ) F2 intercross males (n = 228), which facilitated identification of 11 loci associated with aggressive disease development. Microarray data derived from 126 (TRAMPxNOD/ShiLtJ) F2 primary tumors were used to prioritize candidate genes within QTLs, with candidate genes deemed as being high priority when possessing both high levels of expression-trait correlation and a proximal expression QTL. This process enabled the identification of 35 aggressive prostate tumorigenesis candidate genes. The role of these genes in aggressive forms of human prostate cancer was investigated using two concurrent approaches. First, logistic regression analysis in two human prostate gene expression datasets revealed that expression levels of five genes (CXCL14, ITGAX, LPCAT2, RNASEH2A, and ZNF322) were positively correlated with aggressive prostate cancer and two genes (CCL19 and HIST1H1A) were protective for aggressive prostate cancer. Higher than average levels of expression of the five genes that were positively correlated with aggressive disease were consistently associated with patient outcome in both human prostate cancer tumor gene expression datasets. Second, three of these five genes (CXCL14, ITGAX, and LPCAT2) harbored polymorphisms associated with aggressive disease development in a human GWAS cohort consisting of 1,172 prostate cancer patients. This study is the first example of using a systems genetics approach to successfully identify novel susceptibility genes for aggressive prostate cancer. Such approaches will facilitate the identification of novel germline factors driving aggressive disease susceptibility and allow for new insights into these deadly forms of prostate cancer.