Seminar Calendar
for Mathematical Biology Seminar events the year of Monday, February 9, 2009.

     .
events for the
events containing  

(Requires a password.)
More information on this calendar program is available.
Questions regarding events or the calendar should be directed to Tori Corkery.
     January 2009          February 2009            March 2009     
 Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa
              1  2  3    1  2  3  4  5  6  7    1  2  3  4  5  6  7
  4  5  6  7  8  9 10    8  9 10 11 12 13 14    8  9 10 11 12 13 14
 11 12 13 14 15 16 17   15 16 17 18 19 20 21   15 16 17 18 19 20 21
 18 19 20 21 22 23 24   22 23 24 25 26 27 28   22 23 24 25 26 27 28
 25 26 27 28 29 30 31                          29 30 31            
                                                                   

Thursday, February 12, 2009

Mathematical Biology Seminar
1:00 pm   in 345 Altgeld Hall,  Thursday, February 12, 2009
 Del 
 Edit 
 Copy 
Submitted by rdeville.
Saurabh Sinha (Department of Computer Science, University of Illinois)
Comparative genomics, regression and thermodynamic modeling of cis-regulatory sequences
Abstract: Gene regulation in metazoan development is carried out through ~1000 bp long sequences near genes, called cis-regulatory modules. My group works on computational approaches to discovery and analysis of cis-regulatory modules, one of the grand challenges of genomics today. We aim to improve the specificity of such approaches by (i) scoring spatial clusters of strong as well as weak binding sites, rather than focusing on individual sites separately, and (ii) exploiting evolutionary conservation patterns from multiple related genomes. The former is achieved through probabilistic formalisms called Hidden Markov models, while the cross-species comparison is based on evolutionary models. When comparing two moderately diverged species, our method deals with alignment uncertainties in a principled manner, and explicitly models binding site loss/gain that is commonly observed in orthologous regulatory sequences. On-going work extends this two-species analysis framework to multiple species comparison, in the process making various tradeoffs between computational efficiency and biological realism. Going beyond considering spatial clustering of binding sites, our most recent work studies how the specific combination of binding sites in a cis-regulatory module maps to the function of (the gene expression pattern driven by) the module. This leads us to a logistic regression model of gene expression from sequence, which is shown to explain the expression pattern of over 70% of the modules in our test set. The ability to predict the function of a cis-regulatory module allows us to infer the gene regulatory network, as well as to predict novel modules for experimental validation. Finally, I will present on-going work on a more advanced model of regulatory function, built from fundamental thermodynamic principles. This approach is aimed at distinguishing between possible mechanisms of transcription factor-DNA interaction by analysis of sequence and gene expression data. Preliminary studies are able to quantify the role of cooperative interactions between transcription factors in modulating DNA binding.

Thursday, February 26, 2009

Mathematical Biology Seminar
2:00 pm   in 345 Altgeld Hall,  Thursday, February 26, 2009
 Del 
 Edit 
 Copy 
Submitted by rdeville.
Olgica Milenkovic (Electical and Computer Engineering, University of Illinois)
Good-Turing Distribution Estimation in the Presence of Repetition Errors with Applications to Viral Population Sampling
Abstract: The Good-Turing method and variants thereof are frequently used for estimating the number of unseen species and the distribution of observed species when only a small number of samples is available. Very frequently, the observations are subjected to errors, which may arise either due to the inherent imprecision of the observation process or due to sampling artifacts. Currently, there is no known method for performing distribution estimation that accounts for the presence of errors. We consider a special type of error model - the sticky channel model - which assumes that a symbol from a large alphabet may be repeated several times before being observed. We describe several simple modifications of the Good-Turing and expectation-maximization algorithms that can be used for both the case of known and unknown channel parameters, and describe the importance of the new method for viral population sampling. This is a joint work with Farzad Farnaoud and Narayana Prasad Santhanam.

Thursday, March 12, 2009

Mathematical Biology Seminar
1:00 pm   in 345 Altgeld Hall,  Thursday, March 12, 2009
 Del 
 Edit 
 Copy 
Submitted by rdeville.
Todd Coleman (Electrical and Computer Engineering, University of Illinois)
Convex Optimization Techniques for Parametric and Nonparametric Statistical Analysis of Neural Data Using Point Processes
Abstract: Point process models have been shown to be useful in characterizing neural spiking activity as a function of extrinsic and intrinsic factors. First, we introduce a dynamical point process model for how complex sounds are represented by neural spiking in auditory nerve fibers. This point process model is the first to capture elements of spontaneous rate, refractory effects, frequency selectivity, phase locking at low frequencies, and short-term adaptation, within a compact parametric approach. Secondly, we consider nonparametric approaches for scenarios where the actual point process does not lie in the assumed parametric class. Such methods are attractive due to fewer assumptions, but most methods require excessively complex algorithms. We propose a computationally efficient method for nonparametric maximum likelihood estimation when the conditional intensity function, which characterizes the point process in its entirety, is assumed to satisfy a Lipschitz continuity condition. We show that by exploiting the structure of the likelihood function of a point process, the problem becomes efficiently solvable via Lagrangian duality and we compare our nonparametric estimation method to the most commonly used parametric approaches on goldfish retinal ganglion neural data and activity recorded in CA1 hippocampal neurons from an awake behaving rat. We show that our nonparametric method gives a superior absolute goodness-of-fit measure used for point processes than the most common parametric and semi-parametric approaches. joint work with - Andrea Trevino, graduate student, ECE, UIUC - Jont Allen, Assoc. Prof. ECE, UIUC - Sridevi Sarma, postdoctoral scholar, MIT

Thursday, April 2, 2009

Mathematical Biology Seminar
1:00 pm   in 345 Altgeld Hall,  Thursday, April 2, 2009
 Del 
 Edit 
 Copy 
Submitted by rdeville.
Nathan Price   [email] (UIUC Chemical & Biomedical Engineering, Institute of Genomic Biology)
Relative Expression Analysis for Cancer Diagnosis and Perturbed Network Identification
Abstract: The computational identification from global data sets of stable and predictive patterns of gene and protein relative expression reversals offers a simple, yet powerful approach to target therapies for personalized medicine and to identify networks that are disease-perturbed. We have utilized this approach to identify a molecular classifier (Price et al, PNAS, 2007) with near 100% accuracy for differentiating gastrointestinal stromal tumor (GIST) and leiomyosarcoma (LMS), two cancers that have very similar histopathology, but require very different treatments. We have also developed a novel method, called Differential Rank Conservation (DiRaC) for utilizing multiple relative expression reversals between genes within a priori defined gene sets that are informative about pathways that are perturbed and differentially regulated between phenotypes. The method is noteworthy because it 1) is independent of data normalization; 2) results in an elegant classifier where binary phenotype (e.g. disease) diagnosis can be done based simply on whether the metric is computed to be above or below zero (and is bounded by 1 and -1); and 3) appears thus far to be more accurate than current state-of-the-art pathway comparison methods. Molecular signatures to distinguish amongst many different phenotypes simultaneously and to aid in the identification of potential therapeutic targets are critical to enable systems approaches for personalized medicine.

Thursday, April 9, 2009

Mathematical Biology Seminar
1:00 pm   in 345 Altgeld Hall,  Thursday, April 9, 2009
 Del 
 Edit 
 Copy 
Submitted by rdeville.
Lee DeVille   [email] (UIUC math)
Synchrony-breaking and Rare Events in Stochastic Neuronal Networks
Abstract: We consider a stochastic model for a network of discretized pulse-coupled oscillators containing randomness both in input and in network architecture. We analyze the scalings which arise in certain limits and various finite-size effects as perturbations of these limits. Most notably, for certain parameters this network supports both synchronous and asynchronous modes of behavior and will switch stochastically between these modes due to rare events. We also relate the analysis of this network to classical results in random graph theory --- in particular, those involving the size of the giant component in the Erdos-Renyi random graph. Finally, we study the effect of network topology on certain mean observables. This work is joint with Charles Peskin and Joel Spencer.

Thursday, April 16, 2009

Mathematical Biology Seminar
1:00 pm   in 345 Altgeld Hall,  Thursday, April 16, 2009
 Del 
 Edit 
 Copy 
Submitted by zrapti.
Zoi Rapti   [email] (UIUC Math)
Thermodynamic Signatures of Human Promoter Sequences
Abstract: Using an Ising-type model for the DNA double strand, we analyzed the thermodynamic instability profiles of human promoter sequences. The sequences were classified as containing the following core promoter elements and\or combinations of them: TATA-box, DPE, BRE, Inr, and GC-box. The analysis was based on the opening probability profiles, that are obtained by calculating probabilities of having k (k=1-7) consecutive base-pairs open starting at site n versus n. We report results that associate the location of peaks in the probability instability profiles with the presence of core promoter elements at these locations and in some cases with the location of transcription start sites. We also compare the average thermodynamic profiles of core promoter sequences to random and shuffled sequences and extract characteristic trends. This is joint work with Ruth Kantorovitz, Vlado Gelev, and Anny Usheva.

Thursday, April 23, 2009

Mathematical Biology Seminar
1:00 pm   in 345 Altgeld Hall,  Thursday, April 23, 2009
 Del 
 Edit 
 Copy 
Submitted by rdeville.
Ruth Kantorovitz (UIUC Math)
Alignment-free comparison of biological sequences
Abstract: The similarity of two biological sequences has traditionally been assessed within the well established framework of alignment. However, when studying gene regulation, we often want to identify functional relationships between DNA sequences that do not demonstrate any statistically significant alignment. This is the case, for example, when comparing cis-regulatory modules (CRMs) that are non-orthologous or greatly diverged. We have developed a score for alignment-free sequence comparison, called the D2z score. It is the z-score of the D2 statistic, which counts the number of k-word matches between two sequences. The D2z score is highly successful in discriminating functionally related regulatory sequences from unrelated sequence pairs and outperforms commonly used alignment free methods. In the second part of the talk we will discuss the theoretical justification for using a z-score for normalizing the D2 statistic. We prove Waterman’s conjecture (Lipert et al, PNAS, 2002) about the asymptotic normality of D2. We also extend the results to approximate word matches and discuss applications. This is joint work with Hilary Booth, Conrad Burden and Sue Wilson (ANU), Saurabh Sinha and Gene Robinson (UIUC)

Thursday, October 8, 2009

Mathematical Biology Seminar
1:00 pm   in 345 Altgeld Hall,  Thursday, October 8, 2009
 Del 
 Edit 
 Copy 
Submitted by zrapti.
Tsvi Achler (Department of Computer Science, University of Illinois at Urbana-Champaign)
Using Non-Oscillatory Dynamics to Disambiguate Simultaneous Patterns
Abstract: How does the brain contend with simultaneous patterns? Training methods required for machine learning and neural network algorithms are not optimal for simultaneous patterns. I introduce a nonlinear classifier method motivated by a feedback-inhibition/negative-feedback configuration. Indirect evidence for neuron-circuits and structures that support this configuration are found ubiquitously in brain regions responsible for sensory processing. With a focus on simultaneous pattern processing, the performance of machine learning, neural network and feedback inhibition algorithms are compared. Feedback inhibition networks are robust, inherently process mixtures of previously learned patterns, and predict several cognitive phenomena.