![]() |
![]() |
|
October 2005,
September 2005,
August 2005,
July 2005,
June 2005,
May 2005,
April 2005,
January 2005,
July 2004,
June 2004,
May 2004,
April 2004,
March 2004,
February 2004,
January 2004,
December 2003,
November 2003,
October 2003,
September 2003,
August 2003
Upcoming CELT Offerings (11/17/05 kmw)
*WebCT Vista Modules with WebCT representatives, November 17, 12-1pm and 3-4pm, 1230 Communications To register, email celt@iastate.edu or call 294-5357.
BCB Faculty Part of $29.5 Million Maize Genome Project (11/16/05 kmw) NSF also awarded ISU a separate $600,000 grant to help purchase a supercomputer to use in the corn genome sequencing project. BCB faculty Robert Jernigan and Arun Somani are PIs on this award. Congratulations to Dr. Schnable, Dr. Aluru, Dr. Jernigan and Dr. Somani! Read all about it here. BCB/GDCB 542D - Spring Offering on Plant Transformation and Transgenic Plant Analysis (11/14/05 ts) 1 credit Workshop: This is a one-credit laboratory course aiming at learning basic knowledge and techniques on plant genetic transformation and molecular analysis of transgenic plants. Upon completion of the course, students should be able to do the following:
Contact person: Kan Wang, 294-4429 Classes Meetings: February 1, 3, 15, 17, 22, 24; March 29, 31; and April 5, 12 BCB/ComS 549 - The Tree of Life!! (11/14/05 ts) Upcoming Baker Center Seminars (11/8/05 kmw) On Tuesday, November 15, Ilya A. Vakser, Center for Bioinformatics, University of Kansas, will present Modeling of protein-protein complexes in structural genomics at 1:10 pm in Alliant Energy-Lee Liu Auditorium in Howe Hall. See Laurence H. Baker Center for Bioinformatics and Biological Statistics seminar series for a complete seminar listing. All seminars are free and open to ISU's bioinformatics and computational biology community.
BCB Faculty Seminar with Stephen Willson, Nov. 11 at 12:10 in E164 Lagomarcino (11/7/05 ts) Suppose that a family of rooted phylogenetic trees with different sets of leaves is given. A supertree for the family would be a single rooted tree T whose leaf set is the union of all the input leaf sets, such that the branching information in T corresponds to the branching information in all the input trees. This talk gives an overview of some methods for finding supertrees. It focuses on a polynomial-time method BUILD-WITH-DISTANCES that makes essential use of distance information provided on the input trees. When a supertree containing also the distance information exists, then the method produces a supertree T. This supertree often shows increased resolution over the trees found by methods that utilize only the topology of the input trees. When no strict supertree exists because the input trees are incompatible, an extension of the method still produces a tree with interesting properties.
November Birthdays (10/28/05; edited 1-4-07 kmw)
Myron Peto, BCB and MGET Jeffry Sander, BCB and MGET Rajakumar Sankula, BCB Trish Stauble Kent Vander Velden, BCB and IGERT Hailong Zhang, BCB alumnus Hua Zhou, BCB alumnus
GOT NEWS?
URL:
|