Difference between revisions of "Chattering"
| Line 18: | Line 18: | ||
<math> \mbox{probability open } \rightarrow \mbox{ closed} \approx \frac{ \mbox{number of open to closed transitions observed}}{ \mbox{ number of times observed in open state}} </math> | <math> \mbox{probability open } \rightarrow \mbox{ closed} \approx \frac{ \mbox{number of open to closed transitions observed}}{ \mbox{ number of times observed in open state}} </math> | ||
| + | |||
| + | The problem is much harder if you cannot always discern what state the channel is in nor, nor when transitions occur. One way that this could happen is if the measurements were noisy -- so noisy that you couldn't reliably tell if the channel was open or closed. | ||
| + | |||
| + | An even more interesting scenario occurs when the channel has more than one state with the same conductance. Typically this happens when the channel has more than one closed state. Remember than most sodium channels are closed both before and after an action potential, but after an action potential many of them are in a different state -- they are inactive. With a patch clamp both the closed and the inactive states would look the same -- no current flowing through the channel. So what if you wanted to estimate probabilities (or reaction rates) between these states. | ||
| + | |||
| + | I have come up with a toy problem to study this. A toy problem is one inspired by an application (biology), but has been abstracted to make it easier to understand and work with. Here is the problem -- there is an open state (O) and closed state (C) and a stuck state (S). | ||
Revision as of 13:52, 24 March 2009
Welcome back everyone.
First the survey from before Spring Break
Next the homework due after Spring Break.
Finally, today's tutorial will be the Chattering Ion Channels Tutorial from Neurons in Action.
The purpose of this tutorial is to prepare you for the lecture on Bayesian filtering.
For today's tutorial you will generate figures that look like the one shown above. Experimentally, (i.e. with real cells and channels) such a figure would be generated with a "patch clamp," The patch clamp technique is described and illustrated very nicely in Neurons in Action.
The ion channel problem I am really interested in is not discussed in Neuron's in Action. Here is the problem: we have an open state an a closed state and we want the probabilities of transitioning between them. For example, if you are in the open state, what is the probability of closing by the next time step. Probabilities make sense here because the data is sampled discretely. If you were doing this for real you would try to estimate reaction rates which is independent of the time step. Obviously probabilities increase as you increase the time step. But probabilities are simpler so we will fix the time step and just deal with probabilities.
If you can tell when transitions occur the problem is trivial. For example, the probability of switching from an open to a closed state is approximately:
The problem is much harder if you cannot always discern what state the channel is in nor, nor when transitions occur. One way that this could happen is if the measurements were noisy -- so noisy that you couldn't reliably tell if the channel was open or closed.
An even more interesting scenario occurs when the channel has more than one state with the same conductance. Typically this happens when the channel has more than one closed state. Remember than most sodium channels are closed both before and after an action potential, but after an action potential many of them are in a different state -- they are inactive. With a patch clamp both the closed and the inactive states would look the same -- no current flowing through the channel. So what if you wanted to estimate probabilities (or reaction rates) between these states.
I have come up with a toy problem to study this. A toy problem is one inspired by an application (biology), but has been abstracted to make it easier to understand and work with. Here is the problem -- there is an open state (O) and closed state (C) and a stuck state (S).
