Cpt S 471/571: Computational Genomics Spring 2015, 3 cr. Where: Sloan 9 When: M WF 11:10-12:00 Instructor weekly office hour for Spring 2015: Tuesdays.

Slides:



Advertisements
Similar presentations
CS6501: Text Mining Course Policy
Advertisements

CIS 528 Introduction to Big Data Computing and Analysis
Today’s Agenda  Syllabus CS2336: Computer Science II.
CPT S 317: Automata and Formal Languages
1 Course Information Parallel Computing Fall 2008.
1 Course Information Parallel Computing Spring 2010.
CS/CMPE 535 – Machine Learning Outline. CS Machine Learning (Wi ) - Asim LUMS2 Description A course on the fundamentals of machine.
Carnegie Mellon Communications, Organizations & Technology Course Organization Syllabus Prithvi N. Rao H. John Heinz III School of Public Policy.
CS 331 / CMPE 334 – Intro to AI CS 531 / CMPE AI Course Outline.
MIS 470: Information Systems Project Yong Choi School of Business Administration CSU, Bakersfield.
1 CPT S 223: Advanced Data Structures (section 01) Fall 2010 School of EECS Washington State University, Pullman MWF 10:10-11 Sloan 5.
EECS 395/495 Algorithmic Techniques for Bioinformatics General Introduction 9/27/2012 Ming-Yang Kao 19/27/2012.
COP4020/CGS5426 Programming languages Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: T, H 10:00am – 11:30am Class website:
CS 450: COMPUTER GRAPHICS COURSE AND SYLLABUS OVERVIEW SPRING 2015 DR. MICHAEL J. REALE.
COMP 151: Computer Programming II Spring Course Topics Review of Java and basics of software engineering (3 classes. Chapters 1 and 2) Recursion.
CSE 1111 Week 1 CSE 1111 Introduction to Computer Science and Engineering.
CSCI 1301 Principles of Computer Science I
Computer Network Fundamentals CNT4007C
Course Syllabus January 21, 2014 CS 426 Senior Projects in Computer Science University of Nevada, Reno Department of Computer Science & Engineering.
COURSE ADDITION CATALOG DESCRIPTION To include credit hours, type of course, term(s) offered, prerequisites and/or restrictions. (75 words maximum.) 4/1/091Course.
COMP Introduction to Programming Yi Hong May 13, 2015.
CPS120: Introduction to Computer Science Fall: 2002 Instructor: Paul J. Millis.
Course Introduction Software Engineering
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
Prof. Barbara Bernal NEW Office in J 126 Office Hours: M 4pm - 5:30 PM Class Lecture: M 6 PM - 8:30 in J133 Weekly Web Lecture between Tuesday to Sunday.
MIS 300: Introduction to Management Information Systems Yong Choi School of Business Administration CSU, Bakersfield.
CSCI-141 Fall Professor Scott C. Johnson
Understanding the Academic Structure of the US Classroom: Syllabus.
Course Guide IS325 Systems Analysis & Design II Ms Fatima Khan Prince Sultan University, College for Women.
CS397-CXZ Algorithms in Bioinformatics ChengXiang (“Cheng”) Zhai, Robert Skeel (Department of Computer Science) Nick Sahinidis (Department of Chemical.
CSCI 51 Introduction to Computer Science Dr. Joshua Stough January 20, 2009.
B. Prabhakaran1 Multimedia Systems Textbook Any/Most Multimedia Related Books Reference Papers: Appropriate reference papers discussed in class from time.
MAT 360 – Lecture 0 Introduction. About me  Moira Chas   Work phone :  Office Location:
Welcome to Numerical Analysis Math 448/548 Cpt S 430/530 Fall 2015 Instructor: John Miller, West 134E Class web page can be found.
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
Jongwook Woo CIS 520 Software Engineering (Syllabus) Jongwook Woo, PhD California State University, LA Computer and Information System.
CPS120: Introduction to Computer Science Winter 2002 Instructor: Paul J. Millis.
Jongwook Woo CIS 528 Introduction to Big Data Science (Syllabus) Jongwook Woo, PhD California State University, LA Computer and Information.
AdvancedBioinformatics Biostatistics & Medical Informatics 776 Computer Sciences 776 Spring 2002 Mark Craven Dept. of Biostatistics & Medical Informatics.
CS Welcome to CS 5383, Topics in Software Assurance, Toward Zero-defect Programming Spring 2007.
IST 210: Organization of Data
COT 5405: Design and Analysis of Algorithms Cliff Zou Spring 2015.
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
1 Data Structures COP 4530 Spring 2010 MW 4:35 PM – 5:50 PM CHE 101 Instructor:Dr. Rollins Turner Dept. of Computer Science and Engineering ENB
Course Overview 1 FCM 710 Architecture of Secure Operating Systems Prof. Shamik Sengupta Office 4210 N
CS151 Introduction to Digital Design Noura Alhakbani Prince Sultan University, College for Women.
CST 223 Concepts of Programming Languages Dr. Sherry Yang PV 171
Welcome to Cpt S 350 Design and Analysis of Algorithms Syllabus and Introduction.
CSE3330/5330 DATABASE SYSTEMS AND FILE STRUCTURES (DB I) CSE3330/5330 DB I, Summer2012 Department of Computer Science and Engineering, University of Texas.
B. Prabhakaran1 Multimedia Systems Reference Text “Multimedia Database Management Systems” by B. Prabhakaran, Kluwer Academic Publishers. – Kluwer bought.
Computer Networks CNT5106C
MAT 279 Data Communication and the Internet Prof. Shamik Sengupta Office 4210 N Fall 2010.
Administrative Preliminaries Computer Architecture.
ICS 151 Digital Logic Design Spring 2004 Administrative Issues.
PROBLEM SOLVING AND PROGRAMMING ISMAIL ABUMUHFOUZ | CS 170.
Course Overview Stephen M. Thebaut, Ph.D. University of Florida Software Engineering.
Jongwook Woo Computer Information Systems CIS 528 Introduction to Big Data Computing and Analysis (Syllabus) Jongwook Woo, PhD California.
Course Overview 1 MAT 279 Data Communication and the Internet Prof. Shamik Sengupta Office 4210 N
CSE6339 DATA MANAGEMENT AND ANALYSIS FOR COMPUTATIONAL JOURNALISM CSE6339, Spring 2012 Department of Computer Science and Engineering, University of Texas.
Formal Languages and Automata Theory
CPT S 317: Automata and Formal Languages
ECE 533 Digital Image Processing
CIS5930 Software Defined Networking
It’s called “wifi”! Source: Somewhere on the Internet!
Cpt S 471/571: Computational Genomics
Cpt S 471/571: Computational Genomics
CPT S 317: Automata and Formal Languages
CS 474/674 – Image Processing Fall Prof. Bebis.
CPE 626 Advanced VLSI Design, Spring 2002 Admin
Presentation transcript:

Cpt S 471/571: Computational Genomics Spring 2015, 3 cr. Where: Sloan 9 When: M WF 11:10-12:00 Instructor weekly office hour for Spring 2015: Tuesdays 3-4pm

Course Objectives To introduce the set of algorithms and data structures that have applications to computational genomics To be able to formulate and/or model a biological problem/system as a computer science problem To be able to design algorithms using appropriate data structures to solve the underlying biological problem To be able to appreciate the role of computer science in modern day biological sciences (interdisciplinary training) To see applicability of algorithms & techniques in other domains such as text mining, pattern matching, etc.

Course Organization Topics: Approximate string matching Exact string matching Probabilistic modeling for biological sequence analysis Applications Genome sequencing, and annotation, Read mapping, Gene identification, Clustering/transcriptomics, Phylogenetics.

Course Focus Specialized Data Structures for Genomic Data Problem Transformation Algorithms & Techniques

Course Material Lecture Notes On course website Textbook References: Edited by S. Aluru. Handbook of Computational Molecular Biology, ISBN: (available through WSU digital library) Durbin, et al. Biological Sequence Analysis: Probabilistic Models of Protein and Nucleic Acids, ISBN: D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, ISBN: Other Useful References: C. Setubal and J. Meidanis. Introduction to Computational Molecular Biology, ISBN: M.S. Waterman. Introduction to Computational Biology, ISBN:

Prerequisites Familiarity with Algorithmic Design & Analysis (ie., Cpt S 450 equivalent) Familiarity with basic Probability fundamentals Biological background NOT required!! C/C++/Java programming experience Perl, Python not O.K.

Grading(for Cpt S 571) Homework problems (20%) 3 Programming projects (40%) 1 Midterm Exam (20%) Survey project (15%)- 6 weeks Propose papers and source material Oral presentation (during the last 2 weeks of class) 5-page whitepaper Classroom participation (5%) Grading policy: curved

Grading(for Cpt S 471) Homework problems (25%) 3 Programming projects (50%) 1 Midterm Exam (20%) Classroom participation (5%) (No Survey project) Grading policy: curved

Course Webpage Contents to watch out for: Homeworks, projects Survey project details Lecture notes Tentative course schedule Links to several reference papers, handouts, and other useful web resources OSBLE

Course Announcements All course announcements will be made through the OSBLE web portal To contact the instructor by , use OSBLE

Homeworks Due in-class on the due date Hardcopies (preferred), if not a PDF/Doc submission by mail Along with the cover sheet

Programming projects Submit on OSBLE dropbox Due 11:59 pm on the respective due dates

Late Submission Policy No late submission allowed Extensions may be allowed under extraordinary circumstances Contact instructor at least 1 week prior to permission

Collaboration Policy All assignments should be done individually unless a specific problem states that "collaboration is permitted". "Collaboration" is defined as a discussion with other students in the same class (no outsiders allowed) aimed at obtaining a better understanding of the problem question and/or exploring potential approaches at a very high level that can lead to a solution. What is collaboration?What is NOT a collaboration? A discussion leading to a better understanding of the problem statement Presenting or showing or sharing in any capacity, your solution or the main part of it to another student (PS: this is allowed in team projects) A high level discussion aimed at arriving at a plausible approach to solving the problem Referring to an online/web document showing a solution to the same or highly related problem posed in the question All writing at the end should be 100% yours.

Collaboration Policy All collaborative efforts should be explicitly acknowledged/cited in the answer sheet by all the participants using the cover sheet. Regardless of whether you collaborate or not, the final writing in the answer sheet should be solely yours. No points will be deducted for collaboration as defined above. Any deviation from the above guidelines will be considered "cheating" and will be subject to academic dishonesty code. This includes sharing (or even showing of) your solutions, looking up solutions on the web and using them, etc.