Instructor : Liming Cai
Office: 544 Boyd
Phone
: 2-6081
Email : cai@cs.uga.edu
Lecture hours: 12:20 - 1:10M and 12:30 - 1:45 TR
Classrooms: 306 Boyd (M) and 326 Boyd (TR)
Office Hours: 9:30-10:30 TR or by appointment
Scope of the course:
Reading Materials
- Papers 4, 5, 6 and 7 following this link [Eddy]
- Pioneer work in SCFG for RNA secondary structure prediction [UCSC group]
- Lightweight SCFGs for RNA secondary structure prediction [Eddy group]
- The language of RNA: a formal grammar that includes pseudoknots [Eddy and Rivas]
- Complex probabilistic models for RNA secondary structure prediction [Eddy group]
- Subclasses of tree-adjoining grammars for RNA secondary structure [Uemura group]
- Tree adjoining grammars for RNA pseudoknots [Uemura group]
- Parallel grammar systems for RNA pseudoknots [Cai and Malmberg group]
- Computational linguistics of biological sequences [Searls group]
- Grammatical representations of Macromolecular structure [Chiang and Searls]
- Computational linguistics for biopolymer structures and statistical mechanics [Dill et al]
- Routes are trees: parsing perspectives on protein folding [Dill group]
- Graph grammar modeling RNA tertiary structure motifs [Major group]
- Stochastic k-tree grammar for biomolecular structure modeling [Cai and Malmberg group]
- PPT in non-coding RNA structure, modeling, prediction, and search [Cai's presentation]
- A ppt presentation in SCFG [from the web]
Projects
Table of content:
- Chomsky grammars
regular, linear and context-free grammars, derivation, ambiguity
- Stochastic grammar models
HMM, SCFG, computation with models
- Parsing algorithms
decoding, probability computation, model learning
- Biomolecular patters and structures
DNA motif detection, RNA secondary structure prediction
- Grammar systems for context-sensitivity
non-Chomsky grammar, mildly CSG
- Modeling of bimolecular higher order structures
applications in protein and RNA tertiary structures
Schecule and format:
The time allocated for each section will be roughly equally, 14/6 weeks. The teaching will be a mix of lectures by the instructor and presentations by students on their literature-readings and research projects. No textbook will be used.
Grading policy:
Grading will be based on project reports (40%), presentations (40%), and participation in classroom discussions (20%).
Prerequisites:
CSCI 2670 (Theory of Computation), or CSCI 4470/6470 (Algorithms), or CSCI 4490/6490 (Algorithms for Computational Biology), or the approval of the instructor.
No prior knowledge, but an interest, in molecular biology is essential for this course.
Academic Dishonesty:
It is expected that the work you submit is your own. Plagiarism and other
forms of academic dishonesty will be handled within the guidelines of the
Student Handbook. The usual penalty for academic dishonesty is loss of credit
for the assignment in question; however, stronger measures may be taken when
conditions warrant.