EECS 395/495 Algorithmic Techniques for Bioinformatics General Introduction 9/27/2012 Ming-Yang Kao 19/27/2012.

Slides:



Advertisements
Similar presentations
Designing and Developing Online Courses. Course Life Cycle Design Develop Implement Evaluate Revise.
Advertisements

Introduction to CS 491 / 2 Senior Design Project I / II Prof. Dr. H. Altay Güvenir.
CS B553: A LGORITHMS FOR O PTIMIZATION AND L EARNING aka “Neural and Genetic Approaches to Artificial Intelligence” Spring 2011 Kris Hauser.
Jianlin Cheng, PhD Informatics Institute, Computer Science Department University of Missouri, Columbia Fall, 2011.
CS/CMPE 535 – Machine Learning Outline. CS Machine Learning (Wi ) - Asim LUMS2 Description A course on the fundamentals of machine.
CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University.
CS 331 / CMPE 334 – Intro to AI CS 531 / CMPE AI Course Outline.
CS 206 Introduction to Computer Science II 09 / 03 / 2008 Instructor: Michael Eckmann.
CS 410 Applied Algorithms Applied Algorithms Lecture #1 Introduction, class information, first problems.
Course Syllabus January 24, 2012 CS 426/CPE 426 Senior Projects in Computer Science/Computer Engineering University of Nevada, Reno Department of Computer.
1 CS 426 Senior Projects Spring 2006 Course Syllabus January 24, 2006.
MIS 470: Information Systems Project Yong Choi School of Business Administration CSU, Bakersfield.
EE 220 (Data Structures and Analysis of Algorithms) Instructor: Saswati Sarkar T.A. Prasanna Chaporkar, Programming.
Data and Text Mining for Computational Biology Introduction.
CSCE 3110 Data Structures and Algorithm Analysis.
Introduction to Programming Environments for Secondary Education CS 1140 Dr. Ben Schafer Department of Computer Science.
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
CS 450: COMPUTER GRAPHICS COURSE AND SYLLABUS OVERVIEW SPRING 2015 DR. MICHAEL J. REALE.
Welcome to CompSci 100! As You Arrive… Make sure you grab a syllabus packet. Read through it. I will be covering the most essential points in my talk,
Introduction CSE 1310 – Introduction to Computers and Programming
CS223 Algorithms D-Term 2013 Instructor: Mohamed Eltabakh WPI, CS Introduction Slide 1.
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.
Course Syllabus January 21, 2014 CS 426 Senior Projects in Computer Science University of Nevada, Reno Department of Computer Science & Engineering.
COMP Introduction to Programming Yi Hong May 13, 2015.
Syllabus and Class Policies MATH 130: Summer 2014.
CS 390 Introduction to Theoretical Computer Science.
Welcome to MT140 Introduction to Management. Unit 1 Outcomes Describe the skills needed by managers Understand the expectations of the course.
CS525 DATA MINING COURSE INTRODUCTION YÜCEL SAYGIN SABANCI UNIVERSITY.
CSci8211: Logistics1 CSci8211: Advanced Computer Networks and Their Applications aka Basic Architecture, Mechanisms and Research Issues in Emerging Software-
B. Prabhakaran1 Multimedia Systems Textbook Any/Most Multimedia Related Books Reference Papers: Appropriate reference papers discussed in class from time.
Computer Science 102 Data Structures and Algorithms CSCI-UA.0102 Fall 2012 Lecture 1: administrative details Professor: Evan Korth New York University.
CS 6961: Structured Prediction Fall 2014 Course Information.
Syllabus CS479(7118) / 679(7112): Introduction to Data Mining Spring-2008 course web site:
Introduction to CS Senior Design Project I / II Prof. Dr. H. Altay Güvenir.
1 CS 426 / CPE 426 Senior Projects Spring 2011 Course Syllabus January 19, 2011.
Introduction to Bioinformatics Biostatistics & Medical Informatics 576 Computer Sciences 576 Fall 2008 Colin Dewey Dept. of Biostatistics & Medical Informatics.
CS-2851 Dr. Mark L. Hornick 1 CS-2852 Data Structures Dr. Mark L. Hornick Office: L341 Phone: web: people.msoe.edu/hornick/
CSCE 496/896 Self-Managing Computer Systems Ying Lu 106 Schorr Center
1 CAP6133: Advanced Topics in Computer Security and Computer Forensics (spring’08) Class Overview Dr. Cliff Zou.
Welcome to MT140 Introduction to Management Karen Foreman.
CS511: Artificial Intelligence II
Overview of Bioinformatics 1 Module Denis Manley..
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
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
SE-2030 Software Engineering Tools and Practices SE-2030 Dr. Mark L. Hornick 1.
Introduction to Information Security J. H. Wang Sep. 18, 2012.
1 Computational Vision CSCI 363, Fall 2012 Lecture 1 Introduction to Vision Science Course webpage:
1 “…it is impossible to be a mathematician without being a poet in soul … imagination and invention are identical … the poet has only to perceive that.
Data Structures and Algorithms in Java AlaaEddin 2012.
B. Prabhakaran1 Multimedia Systems Reference Text “Multimedia Database Management Systems” by B. Prabhakaran, Kluwer Academic Publishers. – Kluwer bought.
IST 210: ORGANIZATION OF DATA Introduction IST210 1.
PROBLEM SOLVING AND PROGRAMMING ISMAIL ABUMUHFOUZ | CS 170.
CSE Wireless and Adhoc networks Instructor: Ayman Alharbi Computer Engineering Dept. (Head of dept. ) Why ?
IMS 4212: Course Introduction 1 Dr. Lawrence West, Management Dept., University of Central Florida ISM 4212 Dr. Larry West
Course Overview Stephen M. Thebaut, Ph.D. University of Florida Software Engineering.
Cynthia Cherry Welcome to AB 140 Unit 1 – Introduction to Management.
Welcome to CS 4390/CS5381: Introduction to Formal Methods
Introduction to CS Senior Design Project I / II
Computer Science 102 Data Structures CSCI-UA
Cpt S 471/571: Computational Genomics
Introduction to CS Senior Design Project I / II
Introduction to CS Senior Design Project I / II
EEL4930/5934 Reconfigurable Computing
Cpt S 471/571: Computational Genomics
CSE 5290: Algorithms for Bioinformatics Fall 2009
Introduction to CS Senior Design Project I / II
CS 474/674 – Image Processing Fall Prof. Bebis.
EEL4930/5934 Reconfigurable Computing
Presentation transcript:

EECS 395/495 Algorithmic Techniques for Bioinformatics General Introduction 9/27/2012 Ming-Yang Kao 19/27/2012

Plan for Today 1.Go over the syllabus, including the following: – Learning strategies for bioinformatics – General ideas for survey papers – General ideas for presentations – General ideas for research projects 2.Have some technical discussions. 29/27/2012

Objective of Bioinformatics Objective: Use computation to effectively and efficiently extract information from biological data. Examples of Data: Data involving the following molecules: – DNA – RNA – Protein – Sugar 39/27/2012

Emphasis of This Course Context: Biological problems change, but the computational techniques for solving them may be similar. Emphasis: 1.We will emphasize algorithmic techniques over specific bioinformatics problems. 2.We will emphasize algorithmic techniques – that are applicable to multiple bioinformatics problems, and – that can likely be adapted to solve new bioinformatics problems. 49/27/2012

Topics 1.Sequence Similarity (2.5 meetings) 2.Suffix Trees (2 meetings) 3.Database Search (2 meetings) 4.DNA Sequencing (3 meetings) 5.RNA Secondary Structures (2.5 meetings) 6.Protein Peptide Sequencing (2.5 meetings) 7.Evolutionary Tree Reconstruction (2 meetings) 8.Evolutionary Tree Comparison (2 meetings) 59/27/2012

Prerequisites for This Interdisciplinary Course 1.Technical knowledge about biology is useful, but not required. 2.Broad intellectual curiosity about computer science is essential. 3.EECS 336 Algorithms or equivalent mathematical maturity is required. 69/27/2012

Learning Strategies for Bioinformatics Research For biology students: 1.Learn CS materials as much as you need to start working on an interdisciplinary research project. 2.Start working on the project as soon as you can. Don’t wait! 3.Continue to learn CS materials while you are working on the project. 79/27/2012

Learning Strategies for Bioinformatics Research For CS students: 1.Learn biology materials as much as you need to start working on an interdisciplinary research project. 2.Start working on the project as soon as you can. Don’t wait! 3.Continue to learn biology materials while you are working on the project. 89/27/2012

Learning Strategies for Bioinformatics Research If you are a non-biology and non-CS student, 1.Learn biology and CS materials as much as you need to start working on an interdisciplinary research project. 2.Start working on the project as soon as you can. Don’t wait! 3.Continue to learn biology and CS materials while you are working on the project. 99/27/2012

Course Work and Grading Policy 1.Active participation in classroom discussions is required. Weekly reading assignments are required. 2.A survey paper is required. Original research is optional but encouraged. 3.One or more presentations may be required. 4.There will be no homework, midterm, or final. 109/27/2012

General Ideas for Survey Papers Step 1: Identify a research topic. Step 2: Choose some, say, 3, papers on this topic. Step 3: Describe the key biology problem addressed in these papers. Step 4: Describe the key algorithmic problems formulated to solve this biology problem. Step 5: Summarize the key algorithmic results. Step 6: Summarize the key empirical results. Step 7: Suggest directions or open problems for further research. Step 8: Propose a reading list for further study. 119/27/2012

General Ideas for In-class Presentations Step 1: Pick a paper. Step 2: Describe the key biology problem addressed in this paper. Step 3: Describe the key algorithmic problems formulated to solve this biology problem. Step 4: Summarize the key algorithmic results and empirical results. Step 5: Suggest directions or open problems for further research. 129/27/2012

General Ideas for In-class Presentations Step 1: Pick a software package. Step 2: Demonstrate how to use it. Step 3: Suggest improvements for the package. 139/27/2012

General Ideas for In-class Presentations Step 1: Pick a databank of biological data. Step 2: Demonstrate how to use it. Step 3: Suggest improvements for the databank. 149/27/2012

General Ideas for Research Projects Step 1: Identify a biology problem. Step 2: Formulate the problem into an algorithmic problem: – Input:... (specify what empirical data is available) – Output:... (specify what information you are seeking) Step 3: Come up with some ideas for algorithms for this problem by yourself or in collaboration with others (e.g., fellow students or me). Step 4: Design algorithms for this algorithmic problem. Step 5: – Implement the algorithms and perform empirical studies. – Analyze and prove the correctness and performance of the algorithms. Step 6: Write up a paper. Step 7: Submit the paper to a conference and/or a journal. 159/27/2012

Required Textbooks Neil C. Jones and Pavel A. Pevzner An Introduction to Bioinformatics Algorithms MIT Press, Wing-Kin Sung Algorithms in Bioinformatics: A Practical Introduction CRC Press, /27/2012

My Coordinates Office: Technology Institute, Room M324 Phone: Office Hours: 10:30--11:30 on Tuesday and Wednesday or by appointment. 179/27/2012

My Home Page and Class Home Page My home page: Class home page, including a complete syllabus: -bioinformatics/index.html 189/27/2012