Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, April 10, 2007, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Jack Snoeyink (Univ. of North Carolina at Chapel Hill)
We can represent molecules (and mechanical linkages in general) as graphs whose vertices correspond to atoms and edges correspond to bonds or constraints between atoms. These graphs can be subjected to first-order rigidity analysis, which essentially counts degrees of freedom of first-order motions at vertices, subject to constraints imposed by edges. I'll introduce a pebble game of Jacobs & co-authors (95&97) as an appealing way to do this counting.
In `allosteric' proteins, binding a small molecule at one site (the allosteric site) affects whether or not another can bind at a second site (the active, or catalytic, site). It is interesting to explore whether this effect may be observed in rigidity analysis of graphs derived from specific allosterics protein. I'll show one example (7GPB), but mostly point out the questions about the pebble game that this type of modeling raises.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login