341- INTRODUCTION TO BIOINFORMATICS Overview of the Course Material 1.

Slides:



Advertisements
Similar presentations
Network Properties 1.Global Network Properties ( Chapter 3 of the course textbook “Analysis of Biological Networks” by Junker and Schreiber) 1)Degree distribution.
Advertisements

The multi-layered organization of information in living systems
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Basics of Comparative Genomics Dr G. P. S. Raghava.
341: Introduction to Bioinformatics Dr. Nataša Pržulj Department of Computing Imperial College London Winter 2011.
University at BuffaloThe State University of New York Young-Rae Cho Department of Computer Science and Engineering State University of New York at Buffalo.
Heuristic alignment algorithms and cost matrices
Non-coding RNA William Liu CS374: Algorithms in Biology November 23, 2004.
Regulatory networks 10/29/07. Definition of a module Module here has broader meanings than before. A functional module is a discrete entity whose function.
27803::Systems Biology1CBS, Department of Systems Biology Schedule for the Afternoon 13:00 – 13:30ChIP-chip lecture 13:30 – 14:30Exercise 14:30 – 14:45Break.
Introduction to Bioinformatics Spring 2008 Yana Kortsarts, Computer Science Department Bob Morris, Biology Department.
Gene Co-expression Network Analysis BMI 730 Kun Huang Department of Biomedical Informatics Ohio State University.
Using Bioinformatics to Make the Bio- Math Connection The Confessions of a Biology Teacher.
Bioinformatics and Phylogenetic Analysis
Schedule for the Afternoon 13:00 – 13:30ChIP-chip lecture 13:30 – 14:30Exercise 14:30 – 14:45Break 14:45 – 15:15Regulatory pathways lecture 15:15 – 15:45Exercise.
Modularity in Biological networks.  Hypothesis: Biological function are carried by discrete functional modules.  Hartwell, L.-H., Hopfield, J. J., Leibler,
Global topological properties of biological networks.
Introduction to BioInformatics GCB/CIS535
Graph, Search Algorithms Ka-Lok Ng Department of Bioinformatics Asia University.
Tutorial 2: Some problems in bioinformatics 1. Alignment pairs of sequences Database searching for sequences Multiple sequence alignment Protein classification.
27803::Systems Biology1CBS, Department of Systems Biology Schedule for the Afternoon 13:00 – 13:30ChIP-chip lecture 13:30 – 14:30Exercise 14:30 – 14:45Break.
Data Mining Presentation Learning Patterns in the Dynamics of Biological Networks Chang hun You, Lawrence B. Holder, Diane J. Cook.
ANALYSIS OF GENETIC NETWORKS USING ATTRIBUTED GRAPH MATCHING.
Bioinformatics Unit 1: Data Bases and Alignments Lecture 3: “Homology” Searches and Sequence Alignments (cont.) The Mechanics of Alignments.
Introduction to molecular networks Sushmita Roy BMI/CS 576 Nov 6 th, 2014.
Signaling Pathways and Summary June 30, 2005 Signaling lecture Course summary Tomorrow Next Week Friday, 7/8/05 Morning presentation of writing assignments.
Systems Biology, April 25 th 2007Thomas Skøt Jensen Technical University of Denmark Networks and Network Topology Thomas Skøt Jensen Center for Biological.
Incorporating Bioinformatics in an Algorithms Course Lawrence D’Antonio Ramapo College of New Jersey.
Protein Classification A comparison of function inference techniques.
Systematic Analysis of Interactome: A New Trend in Bioinformatics KOCSEA Technical Symposium 2010 Young-Rae Cho, Ph.D. Assistant Professor Department of.
341: Introduction to Bioinformatics Dr. Natasa Przulj Deaprtment of Computing Imperial College London
TGCAAACTCAAACTCTTTTGTTGTTCTTACTGTATCATTGCCCAGAATAT TCTGCCTGTCTTTAGAGGCTAATACATTGATTAGTGAATTCCAATGGGCA GAATCGTGATGCATTAAAGAGATGCTAATATTTTCACTGCTCCTCAATTT.
Alignment Statistics and Substitution Matrices BMI/CS 576 Colin Dewey Fall 2010.
Multiple Sequence Alignment CSC391/691 Bioinformatics Spring 2004 Fetrow/Burg/Miller (Slides by J. Burg)
Sequence Analysis Alignments dot-plots scoring scheme Substitution matrices Search algorithms (BLAST)
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
A graph theory approach to characterize the relationship between protein functions and structure of biological networks Serene Wong March 15, 2011.
An Introduction to Bioinformatics
1 Bio + Informatics AAACTGCTGACCGGTAACTGAGGCCTGCCTGCAATTGCTTAACTTGGC An Overview پرتال پرتال بيوانفورماتيك ايرانيان.
Biological Networks Lectures 6-7 : February 02, 2010 Graph Algorithms Review Global Network Properties Local Network Properties 1.
CISC667, S07, Lec5, Liao CISC 667 Intro to Bioinformatics (Spring 2007) Pairwise sequence alignment Needleman-Wunsch (global alignment)
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
Introduction to Bioinformatics Biological Networks Department of Computing Imperial College London March 18, 2010 Lecture hour 18 Nataša Pržulj
Construction of Substitution Matrices
Topological Network Alignment Uncovers Biological Function and Phylogeny Oleksii Kuchaiev¹, Tijana Milenković¹, Vesna Memišević, Wayne Hayes, Nataša Pržulj².
Intel Confidential – Internal Only Co-clustering of biological networks and gene expression data Hanisch et al. This paper appears in: bioinformatics 2002.
Algorithms for Biological Networks Prof. Tijana Milenković Computer Science and Engineering University of Notre Dame Fall 2010.
Phylogenetic Analysis Gabor T. Marth Department of Biology, Boston College BI420 – Introduction to Bioinformatics Figures from Higgs & Attwood.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
Central dogma: the story of life RNA DNA Protein.
EB3233 Bioinformatics Introduction to Bioinformatics.
Runtime O(VE), for +/- edges, Detects existence of neg. loops
1 CIS 4930/6930 – Recent Advances in Bioinformatics Spring 2014 Network problems Tamer Kahveci.
Introduction to biological molecular networks
Bioinformatics Center Institute for Chemical Research Kyoto University
341: Introduction to Bioinformatics
Construction of Substitution matrices
Graph Theory. undirected graph node: a, b, c, d, e, f edge: (a, b), (a, c), (b, c), (b, e), (c, d), (c, f), (d, e), (d, f), (e, f) subgraph.
Biological Networks. Can a biologist fix a radio? Lazebnik, Cancer Cell, 2002.
Step 3: Tools Database Searching
Course Name: Comparative Genomics Conducted by- Shigehiko kanaya & Md. Altaf-Ul-Amin.
1 Survey of Biodata Analysis from a Data Mining Perspective Peter Bajcsy Jiawei Han Lei Liu Jiong Yang.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
Comparative Network Analysis BMI/CS 776 Spring 2013 Colin Dewey
Bioinformatics Overview
CSCI2950-C Lecture 12 Networks
CSCI2950-C Lecture 13 Network Motifs; Network Integration
SEG5010 Presentation Zhou Lanjun.
Basic Local Alignment Search Tool
Presentation transcript:

341- INTRODUCTION TO BIOINFORMATICS Overview of the Course Material 1

Introduction to Biology Biological Terms: DNA, RNA, Gene, Gnome, Codon, Protein, Proteome, Amino acids Central Dogma: – The transcription of DNA to mRNA. – Translation of the mRNA to a protein 2

Sequencing and Sequence Alignment Sequences, Mutations, and Evolution Sequencing technologies: – Sanger Sequencing – Next Generation Sequencing Sequence Alignment: – Why is it needed? – Sequence Similarity Scoring Matrices; e.g. BLOSUM – BLAST Algorithm – Accuracy, Sensitivity and Selectivity of sequence searching – Dynamic Programming based Sequence Alignment Algorithms: Needleman-Wunsch (global alignment), Smith-Waterman(local alignment) 3

Functional Genomic and Microarray Analysis What is gene expression? What are microarrays? What are the steps of microarray experiments? Statistical significance tests that are used for evaluating the results of microarray experiments; e.g., t -test. Data clustering / classification – Distance Measures – Hierarchical clustering – Decision trees – K-means/K-medoids clustering – K-nearest neighbourhood clustering 4

Introduction to Graph Theory Basic definitions on graphs and graph types; e.g. bi -partite graphs, cycles, trees, clique, path, subgraphs, connected component, isomorphism, automorphism, automorphism orbits. Minimum spanning trees – Kruskal’s Algorithm – Prim’s Algorithm Graph representations: – Adjacency Matrix – Adjacency List Running times of Algorithms; upper bounds, lower bounds. Complexity classes of problems: P, NP, NP-Hard Graph Traversal Algorithms: – Breadth-first search – Depth-first search Shortest Path Algorithms – Dijsktra’s Algorithm – Floyd-Warshall algorithm 5

Introduction to Biological Networks Different types of biological networks: – Metabolic Networks – Transcription Regulation Networks – Cell Signalling networks – Protein-protein interaction Networks – Genetic interaction Networks – Protein Structure Networks What do they represent? What are the relations among these network types? What are the available sources of data for obtaining these networks? What are the possible sources of bias in these networks? 6

Network Properties The global network properties: – Degree / Degree Distribution – Clustering Coefficient – Diameter / Shortest Path Length Distribution – Centrality Measures: Degree Centrality Betweenness Centrality Closeness Centrality Eccentricity Centrality The local network properties: – Network motifs – Graphlets / Graphlet Degree Distributions 7

Network Models Different types of network models: – Erdos-Renyi Networks (ER) – Small-world Networks – Scale-free Networks (SF) – Hierarchical Networks – Geometric Networks (GEO) – Generalized Random Networks (ERDD) – Geometric Networks with Gene Duplication / Divergence Events(GEOGD) – Scale-free Networks with Gene Duplications/Divergence Events (SFGD) – Stickiness-index based Networks (STICKY) 8

Network Comparison / Alignment Paralogy / Orthology Network: alignment, integration, querying Network Alignment Algorithms: – Global / Local Alignment – Pairwise Alignment / Multiple Alignment – Functional vs. topological information Alignment quality evaluations measures: o Edge Correctness, o Size of Common Connected Subgraphs, o attributed to chance, o biological quality 9

10 Network Comparison / Alignment Key algorithmic components: – Similarity between nodes Functional Topological – Search (identification of high-scoring alignments) Seed-and-extend Finding an optimal alignment 10

Protein 3D Structure Four levels of protein structure Available data The structure function paradigm Rigid and flexible structure comparison – Algorithms 11

Network Data Integration Today’s lecture 12