Biol425 2011: Difference between revisions

From QiuLab
Jump to navigation Jump to search
imported>Yozen
(→‎April 16: Clarified that output filename should contain the chosen strain, for the extra challenge portion.)
imported>Cmartin
Line 319: Line 319:
Sample scripts will go up slowly, over time, including example SQL statements.
Sample scripts will go up slowly, over time, including example SQL statements.
<!--|-style="background-color:powderblue;"
<!--|-style="background-color:powderblue;"
| Che's assignment, if any, will go here-->
| '''Problems'''<br />
(pg.115-116): 5.1, 5.3
|}
|}



Revision as of 03:11, 21 April 2011

Computational Molecular Biology

BIOL 425/790.49, Spring 2011

Hunter College of the City University of New York

The best way to track changes made to this page is to click on the History tab above, and add the RSS feed that shows up there in your browser. If you use Chrome, please see #Useful Links below for two very handy extensions if you don't have them, or other RSS extensions, already.


Course information

Instructors: Che Martin and Yozen Hernandez

Class Hours: Room 1000G HN; Saturday 11am-2pm

Office Hours: Room 830 HN; Thursdays 12-2pm or by appointment

Contact information:

  • Che: cmartin@gc.cuny.edu, 917-684-0864
  • Yozen: yzhernand@gmail.com, 347-829-6936


Course Description

Background

Biomedical research is becoming a high-throughput science. As a result, information technology plays an increasingly important role in biomedical discovery. Bioinformatics is a new interdisciplinary field formed between molecular biology and computer science.

Contents

This course will introduce both bioinformatics theories and practices. Topics include: database searching, sequence alignment, molecular phylogenetics, structure prediction, and microarray analysis. The course is held in a UNIX-based instructional lab specifically configured for bioinformatics applications. Each session consists of a first-half instruction on bioinformatics theories and a second-half session of hands-on exercises.

Learning Goals

Students are expected to be able to:

  • Approach biological questions evolutionarily ("Tree-thinking")
  • Evaluate and interpret computational results statistically ("Statistical-thinking")
  • Formulate informatics questions quantitatively and precisely ("Abstraction")
  • Design efficient procedures to solve problems ("Algorithm-thinking")
  • Manipulate high-volume textual data using UNIX tools, Perl/BioPerl, R, and Relational Database ("Data Visualization")

Pre-requisites

This 3-credit course is designed for upper-level undergraduates and graduate students. Prior experiences in the UNIX Operating System and at least one programming language are required. Hunter pre-requisites are CSCI132 (Practical Unix and Perl Programming) and BIOL300 (Biochemistry) or BIOL302 (Molecular Genetics), or permission by the instructor.

Textbook

Krane & Raymer (2003). Fundamental Concepts of Bioinformatics. Pearson Education, Inc. (ISBN 0-8053-4633-3)

This book should be available in the Hunter Bookstore, as well as through several popular retailers and resellers online.

Grading & Academic Honesty

Hunter College regards acts of academic dishonesty (e.g., plagiarism, cheating on examinations, obtaining unfair advantage, and falsification of records and official documents) as serious offenses against the values of intellectual honesty. The College is committed to enforcing the CUNY Policy on Academic Integrity and will pursue cases of academic dishonesty according to the Hunter College Academic Integrity Procedures.

Student performance will be evaluated by weekly assignments and projects. While these are take-home projects and students are allowed to work in groups and answers to some of the questions are provided in the back of the textbook, students are expected to compose the final short answers, computer commands, and code independently. There are virtually an unlimited number of ways to solve a computational problem, as are ways and personal styles to implement an algorithm. Writings and blocks of codes that are virtually exact copies between individual students will be investigated as possible cases of plagiarism (e.g., copies from the Internet, text book, or each other). In such a case, the instructor will hold closed-door exams for involved individuals. Zero credits will be given to ALL involved individuals if the instructor considers there is enough evidence for plagiarism. To avoid being investigated for plagiarism, Do Not Copy from Others & Do Not Let Others Copy Your Work.

Submit assignments in Printed Hard Copies. Email attachments will NOT be accepted. Each assignment will be graded based on timeliness (10%), completeness (30%), whether executable or having major errors (20%), correctness of the final output (20%), algorithm efficiency (10%), and cleanness and readability in programming styles (10%).

The grading scheme for the course, is as follows (Subject to some change. You will be notified with sufficient time):

  • Assignments (50%): 10 exercises.
  • Mid-term (20%): In class Assignment + Take home to be collected on the same day.
  • Final exam (20%)
  • Classroom Q & A (5%): Read the chapters before lecture.
  • Attendance (5%): 1-2 absences = -2.5%. More than 2 = -5%.

Programming Assignment Expectations

All code must begin with the lines in the Perl slides, without exception. For each assignment, unless otherwise stated, I would like the full text of the source code. Since you cannot print using the text editor in the lab (even if you are connected from home), you must copy and paste the code into a word processor or a local text editor. If you are using a word processor, change the font to a fixed-width/monospace font. On Windows, this is usually Courier.

Code indentation is your personal taste, so long as it is consistent and readable. Use comments whenever you think either the code is unclear, or simply as a guideline for yourself. Well-commented code improves readability, but be careful not overdo it.

Also, unless otherwise stated, both the input and the output of the program must be submitted as well. This should also be in fixed-width font, and you should label it in such a way so that I know it is the program's input/output. This is so that I know that you've run the program, what data you have used, and what the program produced.

If you are working from the lab, one option is to email the code to yourself, change the font, and then print it somewhere else as there is no printer in the lab.

Course Schedule (All Saturdays)

Dates and assignments below are subject to some change

"Lecture slides" links will be available either during or before each lecture, in PDF.

Homework assignments are due the week *after* the date under which they appear. ie, an assignment posted under Jan 29 is due the following lecture, on Feb 5.

January 29

  • Course Overview
  • Tutorial: UNIX Account, Tools, & Emacs [Lecture Slides]
  • UNIX Tutorial: Please check the new #Useful Links section below
  • How to connect remotely: (Windows) (Mac)
  • Homework: This homework will *not* be graded. It is for practice purposes ONLY.

February 5

February 12

NO CLASS

(Read Chapter 6 for next class)

February 19

Yozen will not be lecturing

  • Chapter 6. Gene and Genome Structures [Lecture Slides Lecture Slides Ch.6-Che
  • Tutorial: ORF Prediction using GLIMMER
  • Homework: This homework will be graded.

February 26

March 5

March 12

March 19

  • REVIEW Session for MID-TERM EXAMS

March 26

  • MID-TERM

April 2

April 9

April 16

  • Topic: Relational Database and SQL
  • Tutorial: the Borrelia Genome Database
  • Homework: SQL-embedded PERL