[Colloquium] Fwd: Guest speaker announcement
Margery Ishmael
marge at cs.uchicago.edu
Wed Feb 7 15:40:51 CST 2007
Begin forwarded message:
> From: "Ponda Barnes" <pondabarnes at tti-c.org>
> Date: February 7, 2007 3:33:01 PM CST
> To: <colloquium at ttic.uchicago.edu>
> Cc: <colloquium-request at nagoya.uchicago.edu>, <marge at cs.uchicago.edu>
> Subject: Guest speaker announcement
>
>
>
> TTI-C Guest Speaker
>
>
>
> Presented by: Toyota Technological Institute
>
>
>
> Speaker: Mehmet Koyuturk
>
> Speaker’s home page: http://www.cs.purdue.edu/people/faculty/koyuturk/
>
>
>
> Date: Thursday, February 8, 2007
>
> Location: TTI Conference room, 2nd floor- Press Building
>
> Time: 10:00am
>
>
>
> Title: Comparative Analysis of Molecular Interaction Network
>
>
>
> Abstract:
>
>
>
> Emergence of high-throughput experiments and resulting databases
> capture relationships and interactions between biomolecules. These
> interactions enable modeling and analysis of a cell from a systems
> perspective - generally using network models. In this talk, we
> focus on development of computational tools and statistical models
> for comparative analysis of molecular interaction networks. These
> tools
>
> target understanding of functional modularity in the cell by
> extracting novel information from massive amounts of interaction
> data, through integration of cellular organization, functional
> hierarchy, and evolutionary conservation.
>
>
>
> We first discuss the problem of identifying conserved sub-networks
> in a collection of interaction networks belonging to diverse
> species. The main algorithmic challenges here stem from the NP-hard
>
> sub graph isomorphism problem that underlies frequent sub graph
> discovery. Three decades of research into theoretical aspects of
> this problem has highlighted the futility of syntactic approaches,
> thus motivating use of semantic information. Using a biologically
> motivated homolog contraction technique for relating proteins
> across species, we render this problem tractable. We
> experimentally show that the proposed method can be used as a
> pruning heuristic that accelerates existing techniques
> significantly, as well as a standalone tool that conveys
> significant biological insights at near-interactive rates.
>
>
>
> With a view to understanding the conservation and divergence of
> modular substructures, we also develop network alignment
> techniques, grounded in theoretical models of network evolution.
> Through graph-theoretic modeling of evolutionary events in terms of
> matches, mismatches, and duplications, we reduce the alignment
> problem to a graph optimization problem and develop heuristics to
> solve this problem efficiently. In order to assess the statistical
> significance of the patterns identified by our algorithms, we
> probabilistically analyze the distribution of highly connected and
> conserved sub graphs in random graphs. Our methods and algorithms
> are implemented on various platforms and tested extensively on a
> comprehensive collection of molecular interaction data,
> illustrating their effectiveness in terms of providing novel
> biological insights as well as computational efficiency.
>
>
>
> This is joint work with Yohan Kim, Shankar Subramaniam (University
> of California, San Diego), Wojciech Szpankowski, and Ananth Grama
> (Purdue University) and is supported by the National Institutes of
> Health.
>
>
>
>
>
> If you have any questions or would like to meet the speaker, please
> contact Ponda Barnes at pondabarnes at tti-c.org.
>
> For future talks and events, please go to the TTI-C events calendar
> at http://ttic.uchicago.edu/cal/month.php
>
>
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.cs.uchicago.edu/pipermail/colloquium/attachments/20070207/2a3e41bc/attachment-0001.htm
More information about the Colloquium
mailing list