Name
Abstract | ||
|---|---|---|
Biological networks are fast becoming a popular tool for modeling high-throughput data, especially due to the ability of the network model to readily identify structures with biological function. However, many networks are fraught with noise or coincidental edges, resulting in signal corruption. Previous work has found that the implementation of network filters can reduce network noise and size while revealing significant network structures, even enhancing the ability to identify these structures by exaggerating their inherent qualities. In this study, we implement a hybrid network filter that combines features from a spanning tree and near-chordal subgraph identification to show how a filter that incorporates multiple graph theoretic concepts can improve upon network filtering. We use three different clustering methods to highlight the ability of the filter to maintain network clusters, and find evidence that suggests the clusters maintained are of high importance in the original unfiltered network due to high-degree and biological relevance (essentiality). Our filter highlights the advantages of integration of graph theoretic concepts into biological network analysis. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/HPCSim.2013.6641422 | High Performance Computing and Simulation |
Keywords | Field | DocType |
bioinformatics,data analysis,pattern clustering,trees (mathematics),bioinformatics,biological function,biological network analysis,biological relevance,clustering methods,coincidental edges,correlation networks,high-throughput data modeling,near-chordal subgraph identification,network filtering,network model,network noise reduction,network size reduction,noise edges,spanning tree identification,structure identification,structure-preserving hybrid-chordal filter,bioinformatics,clusters,correlation networks,hub nodes,network filters,spanning trees | Dynamic network analysis,Biological network,Computer science,Chordal graph,Filter (signal processing),Theoretical computer science,Spanning tree,Sampling (statistics),Cluster analysis,Network model | Conference |
ISBN | Citations | PageRank |
978-1-4799-0836-3 | 0 | 0.34 |
References | Authors | |
8 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kathryn Dempsey | 1 | 79 | 8.12 |
| Tzu-Yi Chen | 2 | 111 | 13.48 |
| Sriram Srinivasan | 3 | 379 | 27.92 |
| Sanjukta Bhowmick | 4 | 120 | 18.83 |
| Hesham H. Ali | 5 | 276 | 47.48 |