• Nie Znaleziono Wyników

Introduction to Bioinformatics

N/A
N/A
Protected

Academic year: 2021

Share "Introduction to Bioinformatics"

Copied!
1
0
0

Pełen tekst

(1)

Introduction to Bioinformatics

Instructor: Jarek Meller, Dept. of Informatics, UMK & Biomedical Informatics, Cincinnati Children´s Hospital Research Foundation, http://folding.chmcc.org Philosophy of the course: students will learn about biological motivation, problem formulation and algorithmic solutions as well as practical protocols and bioinformatics tools being used to support genomic sciences.

Number of lectures: 20; each lecture 1.5 hours (30 hours in 10 two-lecture blocks).

Prerequisites: basic molecular biology, basic algorithmic concepts, homework assignments involving basic programming skills.

Suggested textbooks (that can also be used to aquire the skills mentioned above) include:

Durbin, Eddy, Krogh and Mitchinson, “Biological Sequence Analysis” (ISBN 0 521 62971 3); Pevzner, “Computational Molecular Biology” (ISBN 0-262-16197-4); Gibson and Muse, “A Primer of Genomic Science” (ISBN 0-87893-234-8); Schwarz and

Christianen, “Learning Perl”.

Part I: Ground zero

Lecture 1&2: Browsing the genomes and other ABCs

Lecture 3&4: Sequence alignment tools and first applications Lecture 5&6: Genome-wide expression profiling and genotyping Part II: Problems and algorithms

Lecture 7&8: Motif finding and string matching Lecture 9&10: Physical map and genome assembly

Lecture 11&12: Sequence alignment and Dynamic Programming Lecture 13&14: Multiple alignment and profile Hidden Markov Models Lecture 15&16: Phylogenetic trees and hierarchical clustering

Part III: Applications and integrated toolboxes Lecture 17&18: Gene finding and annotation Lecture 19&20: Protein structure prediction

Cytaty

Powiązane dokumenty

Ⱦɨ ɷɬɨɝɨ ɦɵ ɧɟ ɛɵɥɢ ɡɧɚɤɨɦɵ, ɹ ɜɢɞɟɥɚ ɟɝɨ ɬɨɥɶɤɨ ɧɚ ɮɨɬɨɝɪɚɮɢɹɯ ɢ ɜ ɂɧɬɟɪɧɟɬɟ. ɂ ɪɨɫɬ ɜ ɷɬɨɦ ɧɟ ɫɵɝɪɚɥ ɫɨɜɟɪɲɟɧɧɨ ɧɢɤɚɤɨɣ ɪɨɥɢ,

ɂɦɟɧɧɨ ɩɨɷɬɨɦɭ ɧɚ ɤɧɢɝɭ ɭɲɺɥ ɝɨɞ, ɚ ɧɟ ɩɨɥɝɨɞɚ, ɤɚɤ ɪɚɧɶɲɟ. ɉɪɢɲɥɨɫɶ ɦɧɨɝɨ ɱɢɬɚɬɶ, ɨɛɳɚɬɶɫɹ

Proof.. 27): Under what hypotheses on X and / a connected function /: X R is monotone or weakly monotone on the closure of the union of all connected levels. Now we shall

Przyjrzyj się uważnie kulom śniegowym, a następnie uporządkuj od najmniejszej do największej wpisując w okienka odpowiednie cyfry rozpoczynając

Celem artykułu jest weryfikacja możliwości wykorzystania koncepcji cyklu życia obszaru turystycznego w procesie zarządzania rozwojem funkcji turystycznej w

A histogram presenting the magnitude of conformational changes and induced fit of just the binding site (dark blue) or the whole molecule (light blue), and the conformational

An 81 metre rope is cut into n pieces of increasing lengths that form an arithmetic sequence with a common difference of d metres.. Given that the lengths of the shortest and

This declaration means that the appearance of a country attribute in an instance document is optional (the default value of use is optional), although if the attribute does appear,