Heuristics for dependency conjectures in proteomic signaling pathways

A key issue in the study of protein signaling networks is understanding the relationships among proteins in the network. Understanding these relationships in the context of a network is one of the major challenges for modern biology [2, 6]. In the laboratory a time series of protein modification measurements is taken in order that relationships among the activations can be conjectured. Laubenbacher and Stigler [5] have developed an algorithm to make conjectures concerning gene expression. Their algorithm analyses the relations as variables in polynomials, using techniques based in computational algebra. This paper focuses on heuristics for applying their method to conjecture dependencies between proteins in signal transduction networks. Categories and Subject Descriptors

• Type: Conference
• Year: 2005
• Where: ACMSE
• Authors: Edward E. Allen, Jacquelyn S. Fetrow, David J. John, Stan J. Thomas
• Keywords: ACMSE 2005, Protein Modification Measurements, Protein Signaling Networks, Proteins, Theoretical Computer Science