O PTICAL M APPING AS A M ETHOD OF W HOLE G ENOME A NALYSIS M AY 4, 2009 C OURSE : 22M:151 P RESENTED BY : A USTIN J. R AMME.

Slides:



Advertisements
Similar presentations
Accurate Assembly of Maize BACs Patrick S. Schnable Srinivas Aluru Iowa State University.
Advertisements

Integrating Genomes D. R. Zerbino, B. Paten, D. Haussler Science 336, 179 (2012) Teacher: Professor Chao, Kun-Mao Speaker: Ho, Bin-Shenq June 4, 2012.
Next Generation Sequencing, Assembly, and Alignment Methods
Profile Hidden Markov Models Bioinformatics Fall-2004 Dr Webb Miller and Dr Claude Depamphilis Dhiraj Joshi Department of Computer Science and Engineering.
Cloning lab results Cloning the human genome Physical map of the chromosomes Genome sequencing Integrating physical and recombination maps Polymorphic.
GNANA SUNDAR RAJENDIRAN JOYESH MISHRA RISHI MISHRA FALL 2008 BIOINFORMATICS Clustering Method for Repeat Analysis in DNA sequences.
. Sequence Alignment via HMM Background Readings: chapters 3.4, 3.5, 4, in the Durbin et al.
Physical Mapping I CIS 667 February 26, Physical Mapping A physical map of a piece of DNA tells us the location of certain markers  A marker is.
Class 02: Whole genome sequencing. The seminal papers ``Is Whole Genome Sequencing Feasible?'' ``Whole-Genome DNA.
Mining SNPs from EST Databases Picoult-Newberg et al. (1999)
Assembly.
Comparative ab initio prediction of gene structures using pair HMMs
CS273a Lecture 4, Autumn 08, Batzoglou Hierarchical Sequencing.
CSE182-L10 LW statistics/Assembly. Whole Genome Shotgun Break up the entire genome into pieces Sequence ends, and assemble using a computer LW statistics.
Introduction to molecular networks Sushmita Roy BMI/CS 576 Nov 6 th, 2014.
Genome sequencing and assembling
The Sorcerer II Global ocean sampling expedition Katrine Lekang Global Ocean Sampling project (GOS) Global Ocean Sampling project (GOS) CAMERA CAMERA METAREP.
Genome Analysis Determine locus & sequence of all the organism’s genes More than 100 genomes have been analysed including humans in the Human Genome Project.
Sequencing a genome and Basic Sequence Alignment
Bacterial Genome Finishing Using Optical Mapping Dibyendu Kumar, Fahong Yu and William Farmerie Interdisciplinary Center for Biotechnology Research, University.
Biotechnology and Genomics Chapter 16. Biotechnology and Genomics 2Outline DNA Cloning  Recombinant DNA Technology ­Restriction Enzyme ­DNA Ligase 
14.3 Studying the Human Genome
Assembling Genomes BCH364C/391L Systems Biology / Bioinformatics – Spring 2015 Edward Marcotte, Univ of Texas at Austin Edward Marcotte/Univ. of Texas/BCH364C-391L/Spring.
De-novo Assembly Day 4.
How to Build a Horse Megan Smedinghoff.
Physical Mapping of DNA Shanna Terry March 2, 2004.
Mouse Genome Sequencing
Biotechnology SB2.f – Examine the use of DNA technology in forensics, medicine and agriculture.
CS 394C March 19, 2012 Tandy Warnow.
Todd J. Treangen, Steven L. Salzberg
A hierarchical approach to building contig scaffolds Mihai Pop Dan Kosack Steven L. Salzberg Genome Research 14(1), pp , 2004.
Analyzing DNA Differences PHAR 308 March 2009 Dr. Tim Bloom.
PROTEIN STRUCTURE NAME: ANUSHA. INTRODUCTION Frederick Sanger was awarded his first Nobel Prize for determining the amino acid sequence of insulin, the.
Protein Sequence Alignment and Database Searching.
Fig Chapter 12: Genomics. Genomics: the study of whole-genome structure, organization, and function Structural genomics: the physical genome; whole.
VAST 2011 Sebastian Bremm, Tatiana von Landesberger, Martin Heß, Tobias Schreck, Philipp Weil, and Kay Hamacher Interactive-Graphics Systems TU Darmstadt,
Laboratory for Molecular and Computational Genomics Optical Mapping of E-coli O157:H7 Alex Lim.
Next generation sequence data and de novo assembly For human genetics By Jaap van der Heijden.
Sequence assembly using paired- end short tags Pramila Ariyaratne Genome Institute of Singapore SOC-FOS-SICS Joint Workshop on Computational Analysis of.
Physical Mapping of DNA BIO/CS 471 – Algorithms for Bioinformatics.
Order independent structural alignment of circularly permutated proteins T. Andrew Binkowski Bhaskar DasGupta  Jie Liang ‡ Bioengineering Computer Science.
Sequencing a genome and Basic Sequence Alignment
Levels of Image Data Representation 4.2. Traditional Image Data Structures 4.3. Hierarchical Data Structures Chapter 4 – Data structures for.
Human Genome.
KEY CONCEPT Biotechnology relies on cutting DNA at specific places.
Biotechnology and Genomics Chapter 16. Biotechnology and Genomics 2Outline DNA Cloning  Recombinant DNA Technology ­Restriction Enzyme ­DNA Ligase 
Biocomputation: Comparative Genomics Tanya Talkar Lolly Kruse Colleen O’Rourke.
PROTEIN PATTERN DATABASES. PROTEIN SEQUENCES SUPERFAMILY FAMILY DOMAIN MOTIF SITE RESIDUE.
A Chinese Postman Problem Based on DNA Computing Z. Yin, F. Zhang, and J. Xu* J. Chem. Inf. Comput. Sci. 2002, 42, Summarized by Shin, Soo-Yong.
Alternative Splicing (a review by Liliana Florea, 2005) CS 498 SS Saurabh Sinha 11/30/06.
Locating and sequencing genes
Chapter 20 DNA Technology and Genomics. Biotechnology is the manipulation of organisms or their components to make useful products. Recombinant DNA is.
COMPUTATIONAL GENOMICS GENOME ASSEMBLY
Whole-Genome Optical Mapping
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Clustering [Idea only, Chapter 10.1, 10.2, 10.4].
Structural genomics includes the genetic mapping, physical mapping and sequencing of entire genomes.
Biotechnology.
Introduction to Bioinformatics Resources for DNA Barcoding
RFLP “Restriction Fragment Length Polymorphism” Basic idea: Uses:
COMPUTATIONAL GENOMICS GENOME ASSEMBLY
Genome sequence assembly
Research in Computational Molecular Biology , Vol (2008)
Sequence comparison: Local alignment
Biology, 9th ed,Sylvia Mader
Biology, 9th ed,Sylvia Mader
Sequence the 3 billion base pairs of human
DNA Solution of the Maximal Clique Problem
(Top) Construction of synthetic long read clouds with 10× Genomics technology. (Top) Construction of synthetic long read clouds with 10× Genomics technology.
Fragment Assembly 7/30/2019.
Presentation transcript:

O PTICAL M APPING AS A M ETHOD OF W HOLE G ENOME A NALYSIS M AY 4, 2009 C OURSE : 22M:151 P RESENTED BY : A USTIN J. R AMME

Presentation Outline Introduction to Optical Mapping Definitions for Understanding Modern Optical Mapping Process Data Analysis ◦ Overview ◦ Steps to Restriction Map Generation Applications of Optical Mapping Conclusions

Optical Mapping (OM) Introduction The number of identified polygenetic diseases is ever increasing Methods to analyze the entire genome will enhance current diagnostic and treatment methods for a variety of diseases Patient-specific genomic analysis has become the goal in genetics-based medical research Optical mapping(OM) is an automated method of ordered restriction map generation with a goal of whole genome analysis that avoids the limitations inherent to traditional techniques

Definitions Restriction Enzymes ◦ Proteins that cleave DNA molecules based on a specific base pair sequence (e.g. ATCG) + =

Definitions Restriction Map ◦ Representation of the cut sites on a given DNA molecule to provide spatial information of genetic loci Optical Mapping ◦ Process to generate ordered restriction maps from single DNA molecules Optical Map ◦ Ordered restriction map of a portion of genomic DNA DNA strand [2]

Slide Removed for Online Posting

Computer Representation of Imaging Data Imaged datasets are converted into barcode patterns corresponding to the cleaved fragments Lengths are determined using an internal λ standard and fluorescence intensity values Computer Representation of Ordered DNA Fragments Imaged Cleaved DNA Fragments [5]

Raw Data Description ◦ Image collection containing genomic restriction fragments of known length deposited in an ordered manner ◦ Fragments represent randomly sheared genomic DNA ◦ Each OM imaging study redundantly represents the entire genomic region of interest Challenges with analyzing individual DNA molecules: ◦ Extra cut sites - physical breakage ◦ Missing cut sites - partial digestion ◦ Loss of small fragments ◦ Sizing error ◦ Chimeric maps- physically overlapped molecules Combining multiple OMs gives more accurate restriction maps Graphing has been used to accomplish this

Steps to Restriction Map Generation 1. Calculation of OM Overlaps 2. Overlap Graph Construction 3. Graph Correction Procedure 4. Identification of Islands 5. Contig Construction 6. Construction of Draft Consensus Map 7. Consensus Map Refinement

Calculation of Overlaps A multitude of OMs are collected per optical mapping experiment Scoring system used to find overlaps between individual optical maps: Scoring system components: Matching sites are rewarded Discordant sites are penalized Length similarity is rewarded [6]

Overlap Graph Construction Overlap Graph = G(V,E) ◦ Literature describes it as a graph, but its technically a digraph ◦ The set of nodes (V) represent individual optical maps ◦ The set of edges (E) represent high quality overlaps between pairs of maps Weighting and orienting the edges of the graph ◦ Edge weights correspond to genomic distances of the overlapping map regions ◦ Orientation based on the sign of distance measurements from neighboring map centerpoints Goal: Heaviest weight path represents the most comprehensive genomic restriction map OM 1 OM 2 OM 3 OM 4 … Graph Construction Optical Mapping Data

Graph Correction Procedure (1) False edges correspond to falsely identified overlaps ◦ Spurious edges  Connect two nodes forming a cycle which is not possible in linear DNA ◦ Orientation consistent false overlaps (cut edge)  Edges that connect two unrelated portions of the genome [4]

Graph Correction Procedure (2) False Nodes  Chimeric maps ◦ Consist of two groups of nodes only connected via a single node (cut vertex) ◦ Connect two unrelated portions of the genome [4]

Identification of Islands Islands correspond to genomic regions spanned by multiple overlapping optical maps Contig Construction For each island, “contigs” are defined as paths from sources to sinks within the overlap graph for the island The most complete representation of the genomic region is represented by the heaviest edge path from source to sink Island 1Island 2Island 3 [4]

Construction of Draft Consensus Map Using the determined paths, the nodes and edges are used to merge the individual optical maps corresponding to each chosen island component Each of the individual composite optical maps are stored for further analysis [4]

Consensus Map Refinement (1) The draft map may contain errors: ◦ Missing cut sites ◦ False cut sites Hidden Markov Model (HMM) for map refinement ◦ Compares draft map to many other optical maps ◦ Statistics used to identify matching, deleted, and inserted cut sites Hidden Markov Model [7]

Consensus Map Refinement (2) The corrected consensus map for each island pieced back together to form a complete genomic restriction map Typically takes iterations for statistical correction of the draft map Sample HMM Path [7]

Applications of Optical Mapping Identification of genetic insertions, deletions, inversions, and repeats Establish genotype-phenotype correlations for advancements in diagnosis and treatment of genetic disorders Reduction of the time needed and the cost to sequence entire strands of DNA In the future: Patient-specific whole genome analysis

Conclusions Optical mapping is a method of restriction map generation for whole genome analysis Applications range from clinical phenotype- genotype correlations to identification of polymorphisms in a variety of diseases In the future, optical mapping technology will help to realize the goal of patient-specific whole genomic analysis Optical Mapping is a modern application of discrete mathematics with potential to change medicine

References 1. Samad A, Huff EF, Cai W, Schwartz DC. Optical mapping: A novel, single- molecule approach to genomic analysis. Genome Res. 1995;5: Ramme AJ. Personal image collection.. 3. Schwartz DC, Samad A. Optical mapping approaches to molecular genomics. Curr Opin Biotechnol. 1997;8: Valouev A, Schwartz DC, Zhou S, Waterman MS. An algorithm for assembly of ordered restriction maps from single DNA molecules. Proc Natl Acad Sci U S A. 2006;103: Aston C, Mishra B, Schwartz DC. Optical mapping and its potential for large-scale sequencing projects. Trends Biotechnol. 1999;17: Valouev A, Li L, Liu YC, et al. Alignment of optical maps. J Comput Biol. 2006;13: Valouev A, Zhang Y, Schwartz DC, Waterman MS. Refinement of optical map assemblies. Bioinformatics. 2006;22:

Questions? Further information available from: 1.) Laboratory for Molecular and Computational Genetics ( 2.) Opgen (