- Integrating Theoretical Alg...
- Edit Event
- Cancel Event
- Preview Reminder
- Send Reminder
- Other events happening in November 2013
Integrating Theoretical Algorithmic Ideas in Empirical Biological Study
Speaker:
Dr. Amos Korman
, French National Center for Scientific Research at the University of Paris Diderot
Date: Monday, November 04, 2013
Time: 4:00 PM to 5:00 PM Note: all times are in the Eastern Time Zone
Public: Yes
Location: G449 Kiva
Event Type:
Room Description:
Host: Nir Shavit
Contact: Linda Lynch, 617.715.2459, lindalynch@csail.mit.edu
Relevant URL: http://www.liafa.jussieu.fr/~pandit/
Speaker URL: None
Speaker Photo:
None
Reminders to:
seminars@csail.mit.edu, bioinfo-seminar@lists.csail.mit.edu
Reminder Subject:
TALK: Integrating Theoretical Algorithmic Ideas in Empirical Biological Study
In recent years, several works have demonstrated how the study of biology can benefit from an algorithmic perspective. In this
talk I discuss a new approach for such a methodology based on combining theoretical tradeoff techniques with biological experiments to
obtain bounds on biological parameters. A proof of concept for this paradigm is provided by considering central search foraging strategies
of desert ants, and obtaining theoretical tradeoffs between the search time and the memory complexity of individuals. Informally, we show
that if the time-competitiveness of the search algorithm is below $\log k$ then the memory size of individuals (when starting the
search) must be roughly $\log\log k$, where $k$ is the total number of individuals. Combining such bounds with successful experiments on
living ants would provide a lower bound on the number of states ants have when commencing the search. Such a lower bound may serve as a
quantitative evidence regarding the quorum sensing mechanism performed inside the nest.
This talk is based on a recent work with Ofer Feinerman (Weizmann Institute)
Research Areas:
Impact Areas:
Created by Patrice Macaluso at Thursday, October 03, 2013 at 4:30 PM.