Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Diffusion Component Analysis: Unraveling Functional Topology in Biological Networks

Diffusion Component Analysis: Unraveling Functional Topology in Biological Networks

Thumbnail Image
Download
Name

1504.02719.pdf

Size

786.16 KB

Format

Adobe PDF

Checksum (MD5)

a9027989b5ce12617cd28aac26fb66c2

Download all files submitted through automated deposit
sword-2018-05-16.original.zip (694.17 KB)
Author(s)
Cho, Hyunghoon
•
Berger Leighton, Bonnie
•
Peng, Jian
Date Issued
April 2015
Journal
Research in Computational Molecular Biology
Publisher
Springer Nature
Citation
Cho, Hyunghoon, Bonnie Berger, and Jian Peng. “Diffusion Component Analysis: Unraveling Functional Topology in Biological Networks.” Research in Computational Molecular Biology (2015): 62–64.
Version
Original manuscript
Abstract
Complex biological systems have been successfully modeled by biochemical and genetic interaction networks, typically gathered from high-throughput (HTP) data. These networks can be used to infer functional relationships between genes or pro- teins. Using the intuition that the topological role of a gene in a network relates to its biological function, local or diffusion-based “guilt-by-association” and graph- theoretic methods have had success in inferring gene functions [1, 2, 3]. Here we seek to improve function prediction by integrating diffusion-based methods with a novel dimensionality reduction technique to overcome the incomplete and noisy nature of network data. A type of diffusion algorithm, also known as random walk with restart (RWR), has been extensively studied in the context of biological networks and effectively applied to protein function prediction (e.g., [1]). The key idea is to propagate information along the network, in order to exploit both direct and indirect linkages between genes. Typically, a distribution of topological similar- ity is computed for each gene, in relation to other genes in the network, so that researchers can select the most related genes in the resulting distribution or, rather, select genes that share the most similar distributions. Though successful, these approaches are susceptible to noise in the input networks due to the high dimensionality of the computed distributions.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/116712
DOI of Published Version
https://doi.org/10.1007/978-3-319-16706-0_9
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.