| JOURNAL OF THEORETICAL BIOLOGY | 卷:258 |
| Basic networks: Definition and applications | |
| Article | |
| Marin, Ignacio1  Hoyas, Sergio2  | |
| [1] IBV CSIC, Valencia 46010, Spain | |
| [2] Univ Valencia, Dept Informat, E-46100 Burjassot, Spain | |
| 关键词: Graph; Module; Interactome; Steiner tree; | |
| DOI : 10.1016/j.jtbi.2009.01.022 | |
| 来源: Elsevier | |
PDF
|
|
【 摘 要 】
We define basic networks as the undirected subgraphs with minimal number of units in which the distances (geodesics, minimal path lengths) among a set of selected nodes, which we call seeds, in the original graph are conserved. The additional nodes required to draw the basic network are called connectors. We describe a heuristic strategy to find the basic networks of complex graphs. We also show how the characterization of these networks may help to obtain relevant biological information from highly complex protein-protein interaction data. (C) 2009 Elsevier Ltd. All rights reserved.
【 授权许可】
Free
【 预 览 】
| Files | Size | Format | View |
|---|---|---|---|
| 10_1016_j_jtbi_2009_01_022.pdf | 508KB |
PDF