Spectral Decomposition of Signaling Networks

Many dynamical processes can be represented as directed attributed graphs or Petri nets where relationships between various entities are explicitly expressed. Signaling networks modeled as Petri nets are one class of such graphical modeling and representations. These networks encode how different protein in specific compartments, interact to create new protein products. Initially, the proteins and rules governing their interactions are curated from literature and then refined with experimental data. Variation in these networks occurs in topological structure, size, and weights associated on edges. Collectively, these variations are quite significant for manual and interactive analysis. Furthermore, as new information is added to these networks, the emergence of new computational models becomes paramount. From this perspective, hierarchical spectral methods are proposed and applied for inferring similarities and dissimilarities from an ensemble of graphs that corresponds to reaction networks. The technique has been implemented and tested on curated signaling networks that are derived for breast cancer cell lines

[1]  W. Haemers Interlacing eigenvalues and graphs , 1995 .

[2]  Horst Bunke,et al.  A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Jitendra Malik,et al.  Normalized Cut and Image Segmentation , 1997 .

[4]  Christian A. Rees,et al.  Molecular portraits of human breast tumours , 2000, Nature.

[5]  B. Mohar Some applications of Laplace eigenvalues of graphs , 1997 .

[6]  Edwin R. Hancock,et al.  Spectral Clustering of Graphs , 2003, GbRPR.

[7]  José Meseguer,et al.  Pathway Logic: Symbolic Analysis of Biological Signaling , 2001, Pacific Symposium on Biocomputing.

[8]  Tak W. Mak,et al.  Beyond PTEN mutations: the PI3K pathway as an integrator of multiple inputs during tumorigenesis , 2006, Nature Reviews Cancer.

[9]  Carolyn L. Talcott,et al.  Pathway logic modeling of protein functional domains in signal transduction , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

[10]  Joachim M. Buhmann,et al.  Pairwise Data Clustering by Deterministic Annealing , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Bruce Hendrickson,et al.  A Spectral Algorithm for Seriation and the Consecutive Ones Problem , 1999, SIAM J. Comput..

[12]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Carolyn L. Talcott,et al.  Pathway logic modeling of protein functional domains in signal transduction. , 2003 .

[14]  Edwin R. Hancock,et al.  Spectral Simplification of Graphs , 2004, ECCV.

[15]  C. Sawyers,et al.  The phosphatidylinositol 3-Kinase–AKT pathway in human cancer , 2002, Nature Reviews Cancer.

[16]  JOSEP DÍAZ,et al.  A survey of graph layout problems , 2002, CSUR.

[17]  D. Hanahan,et al.  The Hallmarks of Cancer , 2000, Cell.

[18]  Edwin R. Hancock,et al.  Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Y. Yarden,et al.  Untangling the ErbB signalling network , 2001, Nature Reviews Molecular Cell Biology.