Presentation is loading. Please wait.

Presentation is loading. Please wait.

Michael Schroeder BioTechnological Center TU Dresden Biotec Discrete Algorithms for Computational Biology Gene Myers, MPI-CBG Michael Schroeder, Biotec,

Published byBernard Fleming Modified over 9 years ago

Similar presentations

Presentation on theme: "Michael Schroeder BioTechnological Center TU Dresden Biotec Discrete Algorithms for Computational Biology Gene Myers, MPI-CBG Michael Schroeder, Biotec,"— Presentation transcript:

1 Michael Schroeder BioTechnological Center TU Dresden Biotec Discrete Algorithms for Computational Biology Gene Myers, MPI-CBG Michael Schroeder, Biotec, TUD Dresden Michael Hiller, MPI-CBG

2 By Michael Schroeder, Biotec2 Bioinformatics BIOlogy matheMATICS INFORmatics

3 By Michael Schroeder, Biotec3 Bioinformatics Bioinformatics = Biological + Informatics

4 By Michael Schroeder, Biotec4 Bioinformatics Bioinformatics = Biological + Informatics - Logical

5 Synopsis nComputational problems and algorithmic solutions for genomic data nPre-requesite: Data structure and basic algorithms nGoal: n(a) able to design a dynamic programming n(b) understand sequence comparison and Hidden Markov Model methods n(c) understand, use, and programme sequence-based bioinformatics By Michael Schroeder, Biotec5

6 Part 1: Sequence comparison nWeek 1: Primer on Molecular Biology nWeek 2-5: Sequence Comparison, theory and practice nThe basic dynamic programming algorithm, gap cost variations, extension to patterns. nAcceleration: indexing, filtration methods, FASTA and BLAST as examples. nMulti-sequence alignment: scoring schemes, greedy/DCA/MSA/round-robin heuristics. By Michael Schroeder, Biotec6

7 Part 2: Gene Finding nWeek 6-9: Gene Finding nApproaches: statistical, homology-based, Bayesian via Hidden Markov Models. nHidden Markov Models (HMMs): Viterbi and forward/backward algorithms By Michael Schroeder, Biotec7

8 Part 3: Phylogeny nWeek 10-13: Phylogeny nJukes-Cantor model, maximum-likelihood method, distance-based methods, neighbor-joining, HMMs. Genome rearrangements By Michael Schroeder, Biotec8

9 Part 4: Optional topics nWeek 14: Optional Topics (per instructor and time permitting) nRNA Secondary Structure: Definitions, Scoring schemes, dynamic programming approaches. nMotif Finding: Repeat finding. Promoter and enhancer recognition. Signal peptide recognition. nGenotyping: Basic genetics, haplotype determination, haplotype blocks, forensic identification. nGenome Sequence Assembly: Technology overview. Overlap-layout-consensus paradigm. Approaches. By Michael Schroeder, Biotec9

10 By Michael Schroeder, Biotec10 Getting in touch Email: ms@biotec.tu-dresden.de Web site: http://www.biotec.tu-dresden.de/schroeder

11 By Michael Schroeder, Biotec11 Useful books

Download ppt "Michael Schroeder BioTechnological Center TU Dresden Biotec Discrete Algorithms for Computational Biology Gene Myers, MPI-CBG Michael Schroeder, Biotec,"

Similar presentations

1 Applications of Dynamic Programming zTo sequence analysis Shotgun sequence assembly Multiple alignments Dispersed & tandem repeats Bird song alignments.

1 Applications of Dynamic Programming zTo sequence analysis Shotgun sequence assembly Multiple alignments Dispersed & tandem repeats Bird song alignments.
數據分析 David Shiuan Department of Life Science Institute of Biotechnology Interdisciplinary Program of Bioinformatics National Dong Hwa University.

數據分析 David Shiuan Department of Life Science Institute of Biotechnology Interdisciplinary Program of Bioinformatics National Dong Hwa University.
Introduction BNFO 602 Usman Roshan. Course grade Project: –Find a bioinformatics topic by Feb 5th. This can be a paper or a research question you wish.

Introduction BNFO 602 Usman Roshan. Course grade Project: –Find a bioinformatics topic by Feb 5th. This can be a paper or a research question you wish.
BIOINFORMATICS Ency Lee.

BIOINFORMATICS Ency Lee.
1 (c) Mark Gerstein, 1999, Yale, bioinfo.mbb.yale.edu BIOINFORMATICS Introduction Mark Gerstein, Yale University bioinfo.mbb.yale.edu/mbb452a.

1 (c) Mark Gerstein, 1999, Yale, bioinfo.mbb.yale.edu BIOINFORMATICS Introduction Mark Gerstein, Yale University bioinfo.mbb.yale.edu/mbb452a.
Bioinformatics “half a year in the lab can easily save you an afternoon in front of the computer….” (unknown)

Bioinformatics “half a year in the lab can easily save you an afternoon in front of the computer….” (unknown)
. Class 1: Introduction. The Tree of Life Source: Alberts et al.

. Class 1: Introduction. The Tree of Life Source: Alberts et al.
Non-coding RNA William Liu CS374: Algorithms in Biology November 23, 2004.

Non-coding RNA William Liu CS374: Algorithms in Biology November 23, 2004.
Educational Outreach in the Vision lab. What is “educational outreach”? Educational outreach......supports formal or classroom-based education...supports.

Educational Outreach in the Vision lab. What is “educational outreach”? Educational outreach......supports formal or classroom-based education...supports.
Profile-profile alignment using hidden Markov models Wing Wong.

Profile-profile alignment using hidden Markov models Wing Wong.
Introduction to Bioinformatics Spring 2008 Yana Kortsarts, Computer Science Department Bob Morris, Biology Department.

Introduction to Bioinformatics Spring 2008 Yana Kortsarts, Computer Science Department Bob Morris, Biology Department.
Bioinformatics: a Multidisciplinary Challenge Ron Y. Pinter Dept. of Computer Science Technion March 12, 2003.

Bioinformatics: a Multidisciplinary Challenge Ron Y. Pinter Dept. of Computer Science Technion March 12, 2003.
Bioinformatics and Phylogenetic Analysis

Bioinformatics and Phylogenetic Analysis
Introduction to Computational Biology Topics. Molecular Data Definition of data  DNA/RNA  Protein  Expression Basics of programming in Matlab  Vectors.

Introduction to Computational Biology Topics. Molecular Data Definition of data  DNA/RNA  Protein  Expression Basics of programming in Matlab  Vectors.
. Class 5: HMMs and Profile HMMs. Review of HMM u Hidden Markov Models l Probabilistic models of sequences u Consist of two parts: l Hidden states These.

. Class 5: HMMs and Profile HMMs. Review of HMM u Hidden Markov Models l Probabilistic models of sequences u Consist of two parts: l Hidden states These.
Bio 465 Summary. Overview Conserved DNA Conserved DNA Drug Targets, TreeSAAP Drug Targets, TreeSAAP Next Generation Sequencing Next Generation Sequencing.

Bio 465 Summary. Overview Conserved DNA Conserved DNA Drug Targets, TreeSAAP Drug Targets, TreeSAAP Next Generation Sequencing Next Generation Sequencing.
Comparative ab initio prediction of gene structures using pair HMMs

Comparative ab initio prediction of gene structures using pair HMMs
Michael Schroeder BioTechnological Center TU Dresden Biotec Algorithmic Bioinformatics.

Michael Schroeder BioTechnological Center TU Dresden Biotec Algorithmic Bioinformatics.
Computational Genomics Lecture 1, Tuesday April 1, 2003.

Computational Genomics Lecture 1, Tuesday April 1, 2003.
Ayesha Masrur Khan Spring 2013. Course Outline Introduction to Bioinformatics Definition of Bioinformatics and Related Fields Earliest Bioinformatics.

Ayesha Masrur Khan Spring Course Outline Introduction to Bioinformatics Definition of Bioinformatics and Related Fields Earliest Bioinformatics.

Similar presentations

Ads by Google