BINF 739-002 Spring 2007
Network Based Models in Bioinformatics and Biocomputing
Thanks to Dr. Weller for Creating the Initial Version of this Page
Here is the Link to Dr. Weller's Webpage for this CourseGMU Instructor - Dr.Jeff Solka
Co-Instructor Dr. Jennifer Weller
Meeting Time - 12:30 pm - 3:00 pm Tuesday Spring Semester 2007 (Note New Time!!)
Meeting place: Occoquan Bldg room 304B
Course Description: The student will learn concepts underlying deterministic and stochastic network-based models. These models will be studied within a biological context. Topics that will be covered include: deterministic graph models (graphs, subgraphs, graph automorphism, trees), random graphs (different graph types based on edge connection probability distribution), measures of centrality, robustness, and techniques for graph visualization. Applications of these models to protein networks, regulatory networks, metabolic networks, and gene expression networks, will be studied. Students will be exposed to both concepts and practical examples of the application of network models to bioinformatics/biocomputing data. General analysis tools will include R, BIOCONDUCTOR, and associated network modeling libraries. Homework problems will be assigned to reinforce concepts and develop skills needed for applying these methodologies to real world problems.
Prerequisites: Experience using R, enough biology to understand what gene expression and regulatory pathways are, as well as the different levels of control in cells
Required texts:
"The Regulatory Genome: Gene Regulatory Networks In Development And Evolution" (Hardcover) by Eric H. Davidson, Academic Press; 1st edition (May 30, 2006)
"Graph Theory and Its Applications, Second Edition (Discrete Mathematics and Its Applications)" (Hardcover) by Jonathan L. Gross, Jay Yellen, Chapman & Hall/CRC; 2 edition (September 22, 2005).
It has been pointed out that one edition of the text is available on-line, please follow the link: Link
Class Policies: Students are responsible for all assigned material (homework and readings) and must be prepared to communicate ideas in class.
Homework policies: Students are encouraged to discuss problems and assignments with one another. Homework assignments and tests must reflect the individual efforts of students. Also note that 70% or more of an assignment must reflect the words and synthesis of a student: a mass of material ‘glued together’ from Web resources does not constitute original work even if properly cited, and will be graded accordingly.
Citation Policy: Students are encouraged to read and cite the literature to support their solutions to homework problems. When part of a solution for a homework assignment or the project has been found in a reference, whether Web, journal or book, the student must properly cite that source. Failure to properly cite the work of another constitutes plagiarism; both cheating and plagiarism will be grounds for referral to the GMU Honor Council.
Important Class Dates
Expected Coursework
There will be five quizzes, six homework assignments, an in-class presentation of an article from the literature and an in-class presentation of a project with an accompanying written report.
Project: Each student will be expected to take a method developed during the
course and expand or alter it and then apply it to a dataset presented in one of the papers and compare the results of the two methods,
or apply one of the methods leared in class to a new dataset and discuss how the outcome compares to the previous pathway or to expectations based on
other types of knowledge. The student must present the project to the rest of the class. A formal project report will also be expected. For
late report submissions, the grade will decrease by 10% per day, and submission more than
three days late will not be accepted. No delays on presentations will be allowed, if a
student is aware of a conflict s/he has the option of an early presentation. Plan ahead!
Points awarded: 20%, 10% oral/10% written.
Evaluation: final grade will be based on homework (50%, best 5 of 6 grades), quizzes (20%, best 4 of 5 grades), paper presentation (10%) and final project (20%).
Academic integrity: Students are expected to adhere to the standards of academic integrity set forth by George Mason University and the Bioinformatics program. Policies are detailed in the GMU Student Conduct Code.
Meetings, Tutorials, Webcasts, Software etc.
In class on Jan 29th, Dr. Solka mentioned a meeting that he is chairing next week on campus, that students might have an interest in attending (there is a fee and you must register in advance).
The title is "The second annual conference for Quantitative Methods in Defense and National Security" , or QMDNS2007 and information can be found at this url:
http://www.galaxy.gmu.edu/QMDNS2007/. while a brochure is posted here: Brochure
Also on Jan 29th, Dr. Solka also mentioned graphing software from Dr. Marchetti that is to be used for someof the homework, the tar-gzipped file is available here:
Download software
Here is a set of slides that constitute a tutorial on Graph Data Management from Dr. Olken of LBNL: Download Olken slides
Papers
Web sites of interest (please alert us as you find others)
Lecture notes will be posted below by the Friday following class lectures. This is a courtesy, please do not harass professors about posting lectures prior to class
Lecture 1 notes from Dr. Weller's half Weller Lecture 1 link
Lecture 1 notes from Dr. Solka's half Solka Lecture 1 link
Lecture 2 notes Dr. Solka: using djm to graph in R Solka Lecture 2 link
Lecture 2 notes from Dr. Solka: Structure and Representation Solka Lecture 2 link
Lecture 3 notes from Dr. Weller Weller Lecture 3 link
Lecture 4 notes from Dr. Solka: Trees and Spanning Trees Solka Lecture 4 link
Lecture 5 notes from Dr. Weller Weller Lecture 5 link
Lecture 6 notes from Dr. Solka: Connectivity and the Barabasi Paper Solka Lecture 6 link
Lecture 7 notes from Dr. Solka: Citation Analysis Solka Lecture 7 link
HW assignments will be posted here
Homework 1 notes from Dr. Weller HW1-weller
Homework 1 notes from Dr. Solka HW1-solka
The following table will be used to announce lecture topics, reading and homework assignments, etc. It is subject to change, so please check back frequently.
BINF739 Section 2 Spring 2007
Date
Lecturer
Topic
Assignments
Due date
HW and Quiz Alert
Week I: Jan 22
Solka & Weller
‘Omics and genetics data measurements and representations, Introduction to graph models
Chapter 1 in The Regulatory Genome, Chapter 1 in Graph Theory
Jan 29
HW 1 assigned
Week II: Jan 29
Solka
Using graphs to represent structured data
Chapter 2 in Graph Theory
Feb 6
Quiz 1
Week III: Feb 6
Weller
Regulatory logic of the genome, structure-function relationships and control functions
Chapter 2 in The Regulatory Genome
Feb 13
HW 1 due, HW 2 assigned
Week IV: Feb 13
Solka
The characterization of trees, common tree structures and paths, cycles and edge cuts
Chapter 3, 4 in Graph Theory
Feb 20
Quiz 2
Week V: Feb 20
Weller
Developmental processes, the regulatory state and gene regulatory network circuitry
Chapter 3 in The Regulatory Genome
Feb 27
HW 2 due, HW 3 assigned
Week VI: Feb 27
Solka
Constructing networks, vertices and edges
Chapter 5 in Graph Theory
Mar 6
Quiz 3
Week VII: Mar 6
Solka & Weller
Structural properties of gene regulatory networks for development and body part construction
Chapter 4 in The Regulatory Genome, Chapter 10 in Graph Theory
Mar 20
HW 3 due, HW 4 assigned
Week VIII: Spring Break
NA
NA
NA
NA
NA
Week IX: Mar 20
Weller
Gene structure, gene regulatory networks and predicting evolutionary processes
Chapter 5 in The Regulatory Genome
Mar 27
Quiz 4
Week X: Mar 27
Solka
Finding optimal graph traversals
Chapter 6 in Graph Theory
Apr 3
HW 4 due, HW 5 assigned
Week XI: Apr 3
Solka & Weller
Visualization of graphs and maps, topology and higher order surfaces
Chapter 8 in Graph Theory
Apr 10
Quiz 5
Week XII: Apr 10
Solka & Weller
Visualization of data: coloring of graph components
Chapter 9 in Graph Theory
Apr 17
HW 5 due, HW 6 assigned
Week XIII: Apr 17
Solka & Weller
Digraph models and gene expression networks
Chapter 12 in Graph Theory
Apr 24
NA
Week XIV: Apr 24
Solka & Weller
Student paper presentations
NA
NA
HW 6 due; Paper presentation slides due
Week XV: May 1
Solka & Weller
Student project presentations
NA
NA
Project slides due
Finals Week XVI: May 9th
Solka & Weller
NA
NA
NA
Project Report due (hard copy)