Biol425 2011: Difference between revisions

From QiuLab
Jump to navigation Jump to search
imported>Yozen
m (Corrected room number to be the lab)
imported>Yozen
(Added Che's grading scheme, converted to approx percent. Commented out some assignments, fixed assignments.)
Line 46: Line 46:
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.
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 codes independently. There are virtually 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.
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%).
'''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%.


==Course Schedule (All Saturdays)==
==Course Schedule (All Saturdays)==
Line 66: Line 73:
#Display the absolute path of your home directory
#Display the absolute path of your home directory
#List files in your home directory in long format & ordered by their time stamps
#List files in your home directory in long format & ordered by their time stamps
#List files in the "/data/yoda/b/bio425_2011/" directory from your home directory
#List files in the "/data/yoda/b/student.accounts/bio425_2011/" directory from your home directory
#Copy of the file "/data/yoda/b/bio425_2011/data/GBB.seq" into your home directory
#Copy of the file "/data/yoda/b/student.accounts/bio425_2011/data/GBB.seq" into your home directory
#Count the number of lines in the file "GBB.seq"
#Count the number of lines in the file "GBB.seq"
#Show the first five lines of the file "GBB.seq" & save it to a file with arbitrary name
#Show the first five lines of the file "GBB.seq" & save it to a file with arbitrary name
Line 83: Line 90:
|- style="background-color:powderblue;"
|- style="background-color:powderblue;"
| '''Linux and Molecular Sequences'''<br />
| '''Linux and Molecular Sequences'''<br />
#Stay in your home directory (without changing into the "bio425" directory), count the number of ORFs in the sequence file "GBB.seq" using a single "grep" command and one option
#Stay in your home directory (without changing into the "bio425_2011" directory), count the number of ORFs in the sequence file "GBB.seq" using a single "grep" command and one option
#Achieve the same purpose as above, by using "grep" and "wc"
#Achieve the same purpose as above, by using "grep" and "wc"
#Again, stay in your home directory, filter the DNA sequences in the file "/data/yoda/b/bio425/data/TenSeq.nuc" into upper cases
#Again, stay in your home directory, filter the DNA sequences in the file "/data/yoda/b/student.accounts/bio425_2011/data/TenSeq.nuc" into upper cases
#Filter out the "a"s in the above sequence
#Filter out the "a"s in the above sequence
#Using "sed", filter out the string "plasmid" in the sequence names from the file "/data/yoda/b/bio425/data/GBB.1con"
#Using "sed", filter out the string "plasmid" in the sequence names from the file "/data/yoda/b/student.accounts/bio425_2011/data/GBB.1con"
#Using "cut", extract the third field delimited by "_"
#Using "cut", extract the third field delimited by "_"
#Compose regular expressions matching the Thr, Ser, and Glu codons, respectively
#Compose regular expressions matching the Thr, Ser, and Glu codons, respectively
#Write a BASH loop to count the number of sequences in every *.pep file in the directory "/data/yoda/b/bio425/data/"
#Write a BASH loop to count the number of sequences in every *.pep file in the directory "/data/yoda/b/student.accounts/bio425_2011/data/"
|-style="background-color:powderblue;"
|-style="background-color:powderblue;"
| '''Problems'''<br />
| '''Problems'''<br />
Line 106: Line 113:
*Chapter 6. Gene and Genome Structures [Lecture Slides]
*Chapter 6. Gene and Genome Structures [Lecture Slides]
*'''Tutorial:''' ORF Prediction using GLIMMER
*'''Tutorial:''' ORF Prediction using GLIMMER
*Assignment #3. '''(To be posted)'''
<!--*Assignment #3. '''(To be posted)'''
<!--Gene Identification, read Appendix 1-->
Gene Identification, read Appendix 1-->


===February 26===
===February 26===
*Appendix 1. Basic PERL [Lecture Slides]
*Appendix 1. Basic PERL [Lecture Slides]
*Assignment #4. '''(To be posted)'''
<!--*Assignment #4. '''(To be posted)'''
<!--Write a PERL script to print the reverse complementary strand of a DNA sequence (print the original, complement, and reverse complement strings; 5 pts).  *Questions & Problems (pg.234): A1.2 (5 pts)-->
Write a PERL script to print the reverse complementary strand of a DNA sequence (print the original, complement, and reverse complement strings; 5 pts).  *Questions & Problems (pg.234): A1.2 (5 pts)-->


===March 5===
===March 5===
*Object-Oriented PERL & BioPerl [Lecture Slides]
*Object-Oriented PERL & BioPerl [Lecture Slides]
*Assignment #5. '''(To be posted)'''
<!--*Assignment #5. '''(To be posted)'''
<!--BioPerl-->
BioPerl-->


===March 12===
===March 12===
*Information Theory
*Information Theory
*Tutorial: Sequence Logo
*Tutorial: Sequence Logo
*Assignment #6. '''(To be posted)'''
<!--*Assignment #6. '''(To be posted)'''
<!--Information Contents at Intron-Exon junctions-->
Information Contents at Intron-Exon junctions-->


===March 19===
===March 19===
Line 129: Line 136:
*Tutorial: Pairwise Alignment using BLAST & NUCMER
*Tutorial: Pairwise Alignment using BLAST & NUCMER
*Tutorial: Multiple Alignment using CLUSTALW
*Tutorial: Multiple Alignment using CLUSTALW
*Assignment #7. '''(To be posted)'''
<!--*Assignment #7. '''(To be posted)'''
<!--Questions & Problems (pg.54-55): 2.1, 2.2, 2.3, 2.4-->
Questions & Problems (pg.54-55): 2.1, 2.2, 2.3, 2.4-->


===March 26===
===March 26===
*Chapter 3. Molecular Evolution
*Chapter 3. Molecular Evolution
*Assignment #8. '''(To be posted)'''
<!--*Assignment #8. '''(To be posted)'''
<!--Questions & Problems (pg.75-76): 3.1, 3.2, 3.3 (use first ten codons), 3.4, 3.5, 3.7-->
Questions & Problems (pg.75-76): 3.1, 3.2, 3.3 (use first ten codons), 3.4, 3.5, 3.7-->


===April 2===
===April 2===
Line 143: Line 150:
*Chapter 4. Phylogenetics I. Distance Methods
*Chapter 4. Phylogenetics I. Distance Methods
*Tutorial: PROTDIST and NEIGHBOR using T-Rex Server
*Tutorial: PROTDIST and NEIGHBOR using T-Rex Server
*Assignment #9. '''(To be posted)'''
<!--*Assignment #9. '''(To be posted)'''
<!--Questions & Problems (pg.95-96): 4.1, 4.3, 4.4, 4.7, 4.8-->
Questions & Problems (pg.95-96): 4.1, 4.3, 4.4, 4.7, 4.8-->


===April 16===
===April 16===
*Chapter 5. Phylogenetics II. Character-Based Methods
*Chapter 5. Phylogenetics II. Character-Based Methods
*Tutorial: DNAML and bootstrap analysis using T-Rex Server
*Tutorial: DNAML and bootstrap analysis using T-Rex Server
*Assignment #10. '''(To be posted)'''
<!--*Assignment #10. '''(To be posted)'''
<!--Questions & Problems (pg.115-116): 5.1, 5.2, 5.3, 5.4-->
Questions & Problems (pg.115-116): 5.1, 5.2, 5.3, 5.4-->


===April 23===
===April 23===
*Relational Database and SQL
*Relational Database and SQL
*Tutorial: the Borrelia Genome Database
*Tutorial: the Borrelia Genome Database
*Assignment #11. '''(To be posted)'''
<!--*Assignment #11. '''(To be posted)'''
<!--SQL-embedded PERL-->
SQL-embedded PERL-->


===April 30===
===April 30===
*Statistics
*Statistics
*Tutorial: Statistical Visualization using R
*Tutorial: Statistical Visualization using R
*Assignment #12. '''(To be posted)'''
<!--*Assignment #12. '''(To be posted)'''
<!--R Exercises-->
R Exercises-->


===May 7===
===May 7===
*Chapter 6 (Gene Expression) & Chapter 8 (Proteomics)
*Chapter 6 (Gene Expression) & Chapter 8 (Proteomics)
*Tutorial: Array Data Visualization and Analysis
*Tutorial: Array Data Visualization and Analysis
*Assignment #13. '''(To be posted)'''
<!--*Assignment #13. '''(To be posted)'''
<!--Gene Expression Data Analysis using R-->
Gene Expression Data Analysis using R-->


===May 14===
===May 14===
*Chapter 7. Protein Structure Prediction
*Chapter 7. Protein Structure Prediction
*Assignment #14 (Final Comprehensive Project). '''(To be posted)'''
<--!*Assignment #14 (Final Comprehensive Project). '''(To be posted)'''-->


===May 21===
===May 21===
*Final Project Due (TBA)
*Final Project Due (TBA)


© Weigang Qiu, Hunter College, Last Update Jan 2011
© Weigang Qiu, Hunter College, Last Update Jan 2011

Revision as of 04:33, 29 January 2011

Computational Molecular Biology

BIOL 425/790.49, Spring 2011

Hunter College of the City University of New York

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%.

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.

January 29

  • Course Overview
  • Tutorial: UNIX Account, Tools, & Emacs [Lecture Slides]
  • Homework:

February 5

  • Chapter 1. Central Dogma & Wet Lab Tools [Lecture Slides]
  • Homework:

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]
  • Tutorial: ORF Prediction using GLIMMER

February 26

  • Appendix 1. Basic PERL [Lecture Slides]

March 5

  • Object-Oriented PERL & BioPerl [Lecture Slides]

March 12

  • Information Theory
  • Tutorial: Sequence Logo

March 19

  • Chapter 2. Data Search and Alignments
  • Tutorial: Pairwise Alignment using BLAST & NUCMER
  • Tutorial: Multiple Alignment using CLUSTALW

March 26

  • Chapter 3. Molecular Evolution

April 2

NO CLASSES

April 9

  • Chapter 4. Phylogenetics I. Distance Methods
  • Tutorial: PROTDIST and NEIGHBOR using T-Rex Server

April 16

  • Chapter 5. Phylogenetics II. Character-Based Methods
  • Tutorial: DNAML and bootstrap analysis using T-Rex Server

April 23

  • Relational Database and SQL
  • Tutorial: the Borrelia Genome Database

April 30

  • Statistics
  • Tutorial: Statistical Visualization using R

May 7

  • Chapter 6 (Gene Expression) & Chapter 8 (Proteomics)
  • Tutorial: Array Data Visualization and Analysis

May 14

  • Chapter 7. Protein Structure Prediction

<--!*Assignment #14 (Final Comprehensive Project). (To be posted)-->

May 21

  • Final Project Due (TBA)


© Weigang Qiu, Hunter College, Last Update Jan 2011

Retrieved from "https://wiki.genometracker.org/index.php?title=Biol425_2011&oldid=514"