ACM Home Page
Please provide us with feedback. Feedback
Heuristics for dependency conjectures in proteomic signaling pathways
Full text PdfPdf (401 KB)
Source ACM Southeast Regional Conference archive
Proceedings of the 43rd annual Southeast regional conference - Volume 1 table of contents
Kennesaw, Georgia
SESSION: Algorithms and theory table of contents
Pages: 75 - 79  
Year of Publication: 2005
ISBN:1-59593-059-0
Authors
Edward E. Allen  Wake Forest University, Winston-Salem, North Carolina
Jacquelyn S. Fetrow  Wake Forest University, Winston-Salem, North Carolina
David J. John  Wake Forest University, Winston-Salem, North Carolina
Stan J. Thomas  Wake Forest University, Winston-Salem, North Carolina
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1167350.1167382
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
E. E. Allen, J. S. Fetrow, L. W. Daniel, S. J. Thomas, and D. J. John. Algebraic dependency models of protein signal transduction networks from time-series data. Journal of Theoretical Biology, 2005. submitted.
 
2
E. Alm and A. P. Arkin. Biological networks. Current Opinion in Structural Biology, 13:193--202, 2003.
3
 
4
M. Kanehisa and S. Goto. Kegg: Kyoto encyclopedia of genes and genomes. Nucleic Acid Research, 28:27--30, 2000. http://www.genome.jp/kegg.
 
5
R. Laubenbacher and B. Stigler. A computational algebra approach to the reverse engineering of gene regulatory networks. Journal of Theoretical Biology, 229:532--537, 2004.
 
6
A. Levchenko. Dynamical and integrative cell signaling: Challenges for the new biology. Biotechnology and Bioengineering, 84(7), 2003.
 
7
A. Shanmuganathan, S. V. Avery, S. A. Willetts, and J. E. Houghton. Copper-induced oxidative stress in Saccharomyces cerevisiae targets enzymes of the glycolytic pathway. FEBS Letters, 556:253--259, 2004.
 
8
A. D. Taylor. Mathematics and Politics: Strategy, Voting, Power and Proof. Springer-Verlag, 1995.
 
9
D. Voet and J. Voet. Biochemistry. John Wiley & Sons, 1990.
 
10
J. Yu, V. A. Smith, P. P. Wang, A. J. Hartemink, and E. D. Jarvis. Using bayesian network inference algorithms to recover molecular genetic regulatory networks. In International Conference on Systems Biology (ICSB02), December 2002.


Collaborative Colleagues:
Edward E. Allen: colleagues
Jacquelyn S. Fetrow: colleagues
David J. John: colleagues
Stan J. Thomas: colleagues