Visualizing Gene Clusters using Neighborhood Graphs in R
نویسندگان
چکیده
The visualization of cluster solutions in gene expression data analysis gives practitioners an understanding of the cluster structure of their data and makes it easier to interpret the cluster results. Neighborhood graphs allow for visual assessment of relationships between adjacent clusters. The number of clusters in gene expression data is for biological reasons rather large. As a linear projection of the data into 2 dimensions does not scale well in the number of clusters there is a need for new visualization techniques using non–linear arrangement of the clusters. The new visualization tool is implemented in the open source statistical computing environment R. It is demonstrated on microarray data from yeast.
منابع مشابه
Using Neighborhood Graphs for the Investigation of E. Coli Gene Clusters
Clustering is commonly used in the analysis of gene expression data to find groups of co–expressed genes. The definition of gene clusters is not very clear as genetic interactions are extremely complex. For this reason the relationship between clusters is very important as co–expressed genes can end up in different clusters. The neighborhood graph is a useful tool to visualize the cluster struc...
متن کاملVisualizing the Clusters and Dynamics of HPV Research Area
Purpose: The purpose of the present study is to visualize HPV clusters’ relationships and thematic trends in the world. Methodology: The research type is an applied one with analytical approach and it has been done using co-word analysis. The population of this study consists of articles’ keywords indexed during 2014-2018 in the Web of Science (WoS) in HPV subject area. The total numbers of th...
متن کاملA Toolbox for K-Centroids Cluster Analysis
A methodological and computational framework for centroid-based partitioning cluster analysis using arbitrary distance or similarity measures is presented. The power of highlevel statistical computing environments like R enables data analysts to easily try out various distance measures with only minimal programming effort. A new variant of centroid neighborhood graphs is introduced which gives ...
متن کاملOn common neighborhood graphs II
Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.
متن کاملNet-Ray: Visualizing and Mining Billion-Scale Graphs
How can we visualize billion-scale graphs? How to spot outliers in such graphs quickly? Visualizing graphs is the most direct way of understanding them; however, billion-scale graphs are very difficult to visualize since the amount of information overflows the resolution of a typical screen. In this paper we propose NET-RAY, an open-source package for visualizationbased mining on billion-scale ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008