Ranking Novel Regulatory Genes in Gene Expression Profiles using NetExpress.

Belma Yelbay, Alexander Gow, Hasan M Jamil
{"title":"Ranking Novel Regulatory Genes in Gene Expression Profiles using NetExpress.","authors":"Belma Yelbay,&nbsp;Alexander Gow,&nbsp;Hasan M Jamil","doi":"10.1145/3019612.3021289","DOIUrl":null,"url":null,"abstract":"<p><p>Understanding gene regulation by identifying gene products and determining their roles in regulatory networks is a complex process. A common computational method is to reverse engineer a regulatory network from gene expression profile, and sanitize the network using known information about the genes, their interactions and other properties to filter out unlikely interactors. Unfortunately, due to limited resources most gene expression studies have a limited and small number of time points, and most reverse engineering tools are unable to handle large numbers of genes. Both of these factors play significant roles in influencing the accuracy of the process. In this paper, we present a new gene ranking algorithm from gene expression profiles with a small number of time points so that the most relevant genes can be selected for reverse engineering. We also present a graphical interface called <i>NetExpress</i>, which adopts this algorithm and allows users to set control parameters to effect the desired outcome, and visualize the analysis for iterative fine tuning.</p>","PeriodicalId":74534,"journal":{"name":"Proceedings of the ... Symposium on Applied Computing. Symposium on Applied Computing","volume":"2017 ","pages":"24-27"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3019612.3021289","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ... Symposium on Applied Computing. Symposium on Applied Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3019612.3021289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Understanding gene regulation by identifying gene products and determining their roles in regulatory networks is a complex process. A common computational method is to reverse engineer a regulatory network from gene expression profile, and sanitize the network using known information about the genes, their interactions and other properties to filter out unlikely interactors. Unfortunately, due to limited resources most gene expression studies have a limited and small number of time points, and most reverse engineering tools are unable to handle large numbers of genes. Both of these factors play significant roles in influencing the accuracy of the process. In this paper, we present a new gene ranking algorithm from gene expression profiles with a small number of time points so that the most relevant genes can be selected for reverse engineering. We also present a graphical interface called NetExpress, which adopts this algorithm and allows users to set control parameters to effect the desired outcome, and visualize the analysis for iterative fine tuning.

Abstract Image

利用NetExpress对基因表达谱中的新调控基因进行排序。
通过识别基因产物并确定其在调控网络中的作用来理解基因调控是一个复杂的过程。一种常见的计算方法是从基因表达谱中对调控网络进行逆向工程,并使用有关基因、它们的相互作用和其他特性的已知信息对网络进行净化,以过滤掉不太可能的相互作用。不幸的是,由于资源有限,大多数基因表达研究只有有限的时间点,而且大多数逆向工程工具无法处理大量的基因。这两个因素在影响工艺精度方面都起着重要的作用。本文提出了一种基于时间点较少的基因表达谱的基因排序算法,以便选择最相关的基因进行逆向工程。我们还提出了一个称为NetExpress的图形界面,该界面采用该算法,并允许用户设置控制参数以达到期望的结果,并将分析可视化以进行迭代微调。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信