![[Back]](left_arrow.gif){kind=icon}
DEPARTMENT OF MATHEMATICS
UNIVERSITY OF NEBRASKA AT OMAHA
WHEN:
On Thursday, October 28, 1999 at 2:20 PM
WHERE:
Durham Science Center, Room 255
WHAT:
Jack HeidelA Mathematical Model for Intracellular Signal Transduction
Using Boolean Networks
Part II: Expressing Boolean Connections in Matrix Form
Abstract:
Biochemical signaling pathways can be represented by directed graphs where each node is influenced by the logical connections of the nodes leading into it. Assuming a Boolean logic where each node is either on or off at any given time, there is then a total of 2n different possible states given n nodes. Such an n dimensional network can then be (trivially) represented by a 2n x 2n matrix. The question is: can the network be represented by a smaller matrix of dimension closer to n than to 2n? Several examples will be discussed where dimensional reduction can be achieved. We would appreciate comments, suggestions, and input from anyone else who is interested in this problem.
Refreshments served 20 minutes prior to the talk in DSC 255
BACK