Sequencing and Assembly Cont’d. CS273a Lecture 5, Aut08, Batzoglou Steps to Assemble a Genome 1. Find overlapping reads 4. Derive consensus sequence..ACGATTACAATAGGTT..

Slides:



Advertisements
Similar presentations
Mo17 shotgun project Goal: sequence Mo17 gene space with inexpensive new technologies Datasets in progress: Four-phases of 454-FLX sequencing to max of.
Advertisements

DNA Sequencing.
Phylogeny Tree Reconstruction
CS273a Lecture 5, Win07, Batzoglou Quality of assemblies—mouse N50 contig length Terminology: N50 contig length If we sort contigs from largest to smallest,
CS273a Lecture 4, Autumn 08, Batzoglou Some Terminology insert a fragment that was incorporated in a circular genome, and can be copied (cloned) vector.
DNA Sequencing Lecture 9, Tuesday April 29, 2003.
CS262 Lecture 9, Win07, Batzoglou Fragment Assembly Given N reads… Where N ~ 30 million… We need to use a linear-time algorithm.
Genome Sequence Assembly: Algorithms and Issues Fiona Wong Jan. 22, 2003 ECS 289A.
Some new sequencing technologies. Molecular Inversion Probes.
Class 02: Whole genome sequencing. The seminal papers ``Is Whole Genome Sequencing Feasible?'' ``Whole-Genome DNA.
CS262 Lecture 11, Win07, Batzoglou Some Terminology insert a fragment that was incorporated in a circular genome, and can be copied (cloned) vector the.
Large-Scale Global Alignments Multiple Alignments Lecture 10, Thursday May 1, 2003.
DNA Sequencing. The Walking Method 1.Build a very redundant library of BACs with sequenced clone- ends (cheap to build) 2.Sequence some “seed” clones.
DNA Sequencing Some Terminology insert a fragment that was incorporated in a circular genome, and can be copied (cloned) vector the circular genome (host)
DNA Sequencing.
DNA Sequencing. CS273a Lecture 3, Spring 07, Batzoglou DNA sequencing How we obtain the sequence of nucleotides of a species …ACGTGACTGAGGACCGTG CGACTGAGACTGACTGGGT.
Assembly.
CS273a Lecture 9, Aut08, Batzoglou CS273a Lecture 9, Fall 2008 Quality of assemblies—mouse N50 contig length Terminology: N50 contig length If we sort.
DNA Sequencing and Assembly
DNA Sequencing.
CS273a Lecture 4, Autumn 08, Batzoglou Fragment Assembly (in whole-genome shotgun sequencing) CS273a Lecture 5.
Sequencing and Assembly Cont’d. CS273a Lecture 5, Win07, Batzoglou Steps to Assemble a Genome 1. Find overlapping reads 4. Derive consensus sequence..ACGATTACAATAGGTT..
DNA Sequencing. CS273a Lecture 3, Spring 07, Batzoglou Steps to Assemble a Genome 1. Find overlapping reads 4. Derive consensus sequence..ACGATTACAATAGGTT..
DNA Sequencing. CS262 Lecture 9, Win07, Batzoglou DNA sequencing How we obtain the sequence of nucleotides of a species …ACGTGACTGAGGACCGTG CGACTGAGACTGACTGGGT.
CS273a Lecture 4, Autumn 08, Batzoglou Hierarchical Sequencing.
1 Next Generation Sequencing Itai Sharon November 11th, 2009 Introduction to Bioinformatics.
DNA Sequencing and Assembly. DNA sequencing How we obtain the sequence of nucleotides of a species …ACGTGACTGAGGACCGTG CGACTGAGACTGACTGGGT CTAGCTAGACTACGTTTTA.
$399 Personal Genome Service $2,500 Health Compass service $985 deCODEme (November 2007) (April 2008) $350,000 Whole-genome sequencing (November 2007)
DNA Sequencing. DNA sequencing How we obtain the sequence of nucleotides of a species …ACGTGACTGAGGACCGTG CGACTGAGACTGACTGGGT CTAGCTAGACTACGTTTTA TATATATATACGTCGTCGT.
DNA Sequencing. CS262 Lecture 9, Win06, Batzoglou DNA Sequencing – gel electrophoresis 1.Start at primer(restriction site) 2.Grow DNA chain 3.Include.
CS273a Lecture 1, Autumn 10, Batzoglou DNA Sequencing.
CS273a Lecture 2, Autumn 10, Batzoglou DNA Sequencing (cont.)
DNA Sequencing. CS273a Lecture 3, Autumn 08, Batzoglou DNA sequencing How we obtain the sequence of nucleotides of a species …ACGTGACTGAGGACCGTG CGACTGAGACTGACTGGGT.
CSE182-L10 LW statistics/Assembly. Whole Genome Shotgun Break up the entire genome into pieces Sequence ends, and assemble using a computer LW statistics.
CS273a Lecture 4, Autumn 08, Batzoglou DNA Sequencing.
CS262 Lecture 9, Win07, Batzoglou Conditional Random Fields A brief description.
Genome sequencing and assembling
Compartmentalized Shotgun Assembly ? ? ? CSA Two stated motivations? ?
Genome sequencing. Vocabulary Bac: Bacterial Artificial Chromosome: cloning vector for yeast Pac, cosmid, fosmid, plasmid: cloning vectors for E. coli.
CS 6030 – Bioinformatics Summer II 2012 Jason Eric Johnson
De-novo Assembly Day 4.
How to Build a Horse Megan Smedinghoff.
Genomic sequencing and its data analysis Dong Xu Digital Biology Laboratory Computer Science Department Christopher S. Life Sciences Center University.
CS 394C March 19, 2012 Tandy Warnow.
Todd J. Treangen, Steven L. Salzberg
CS273a Lecture 4, Autumn 08, Batzoglou CS273a 2011 DNA Sequencing.
Sequence assembly using paired- end short tags Pramila Ariyaratne Genome Institute of Singapore SOC-FOS-SICS Joint Workshop on Computational Analysis of.
Genome sequencing Haixu Tang School of Informatics.
Fuzzypath – Algorithms, Applications and Future Developments
CS273a Lecture 4, Autumn 08, Batzoglou CS273a 2013 DNA Structure.
Human Genome.
The Genome Assemblies of Tasmanian Devil Zemin Ning The Wellcome Trust Sanger Institute.
Whole Genome Sequencing (Lecture for CS498-CXZ Algorithms in Bioinformatics) Sept. 13, 2005 ChengXiang Zhai Department of Computer Science University of.
COMPUTATIONAL GENOMICS GENOME ASSEMBLY
1. Assembly by alignment Instead of overlap-layout-consensus we use alignment-consensus 2.
ALLPATHS: De Novo Assembly of Whole-Genome Shotgun Microreads
Genome Research 12:1 (2002), Assembly algorithm outline ● Input and trimming ● Overlap detection ● Error correction ● Evaluation of alignments.
Phusion2 Assemblies and Indel Confirmation Zemin Ning The Wellcome Trust Sanger Institute.
Virginia Commonwealth University
CSCI2950-C Lecture 2 DNA Sequencing and Fragment Assembly
DNA Sequencing.
DNA Sequencing Project
Sequence assembly Jose Blanca COMAV institute bioinf.comav.upv.es.
COMPUTATIONAL GENOMICS GENOME ASSEMBLY
Fragment Assembly (in whole-genome shotgun sequencing)
Genome sequence assembly
Computational Genomics: Genome assembly
CS 598AGB Genome Assembly Tandy Warnow.
CSCI 1810 Computational Molecular Biology 2018
Assembling Genomes BCH339N Systems Biology / Bioinformatics – Spring 2016 Edward Marcotte, Univ of Texas at Austin.
Presentation transcript:

Sequencing and Assembly Cont’d

CS273a Lecture 5, Aut08, Batzoglou Steps to Assemble a Genome 1. Find overlapping reads 4. Derive consensus sequence..ACGATTACAATAGGTT.. 2. Merge some “good” pairs of reads into longer contigs 3. Link contigs to form supercontigs Some Terminology read a long word that comes out of sequencer mate pair a pair of reads from two ends of the same insert fragment contig a contiguous sequence formed by several overlapping reads with no gaps supercontig an ordered and oriented set (scaffold) of contigs, usually by mate pairs consensus sequence derived from the sequene multiple alignment of reads in a contig

CS273a Lecture 5, Aut08, Batzoglou 2. Merge Reads into Contigs Overlap graph:  Nodes: reads r 1 …..r n  Edges: overlaps (r i, r j, shift, orientation, score) Note: of course, we don’t know the “color” of these nodes Reads that come from two regions of the genome (blue and red) that contain the same repeat

CS273a Lecture 5, Aut08, Batzoglou 2. Merge Reads into Contigs We want to merge reads up to potential repeat boundaries repeat region Unique Contig Overcollapsed Contig

CS273a Lecture 5, Aut08, Batzoglou 2. Merge Reads into Contigs Remove transitively inferable overlaps  If read r overlaps to the right reads r 1, r 2, and r 1 overlaps r 2, then (r, r 2 ) can be inferred by (r, r 1 ) and (r 1, r 2 ) rr1r1 r2r2 r3r3

CS273a Lecture 5, Aut08, Batzoglou 2. Merge Reads into Contigs

CS273a Lecture 5, Aut08, Batzoglou 2. Merge Reads into Contigs Ignore “hanging” reads, when detecting repeat boundaries sequencing error repeat boundary??? b a a b …

CS273a Lecture 5, Aut08, Batzoglou Overlap graph after forming contigs Unitigs: Gene Myers, 95

CS273a Lecture 5, Aut08, Batzoglou Repeats, errors, and contig lengths Repeats shorter than read length are easily resolved  Read that spans across a repeat disambiguates order of flanking regions Repeats with more base pair diffs than sequencing error rate are OK  We throw overlaps between two reads in different copies of the repeat To make the genome appear less repetitive, try to:  Increase read length  Decrease sequencing error rate Role of error correction: Discards up to 98% of single-letter sequencing errors decreases error rate  decreases effective repeat content  increases contig length

CS273a Lecture 5, Aut08, Batzoglou 3. Link Contigs into Supercontigs Too dense  Overcollapsed Inconsistent links  Overcollapsed? Normal density

CS273a Lecture 5, Aut08, Batzoglou Find all links between unique contigs 3. Link Contigs into Supercontigs Connect contigs incrementally, if  2 forward-reverse links supercontig (aka scaffold)

CS273a Lecture 5, Aut08, Batzoglou Fill gaps in supercontigs with paths of repeat contigs Complex algorithmic step Exponential number of paths Forward-reverse links 3. Link Contigs into Supercontigs

CS273a Lecture 5, Aut08, Batzoglou 4. Derive Consensus Sequence Derive multiple alignment from pairwise read alignments TAGATTACACAGATTACTGA TTGATGGCGTAA CTA TAGATTACACAGATTACTGACTTGATGGCGTAAACTA TAG TTACACAGATTATTGACTTCATGGCGTAA CTA TAGATTACACAGATTACTGACTTGATGGCGTAA CTA TAGATTACACAGATTACTGACTTGATGGGGTAA CTA TAGATTACACAGATTACTGACTTGATGGCGTAA CTA Derive each consensus base by weighted voting (Alternative: take maximum-quality letter)

CS273a Lecture 5, Aut08, Batzoglou Some Assemblers PHRAP Early assembler, widely used, good model of read errors Overlap O(n 2 )  layout (no mate pairs)  consensus Celera First assembler to handle large genomes (fly, human, mouse) Overlap  layout  consensus Arachne Public assembler (mouse, several fungi) Overlap  layout  consensus Phusion Overlap  clustering  PHRAP  assemblage  consensus Euler Indexing  Euler graph  layout by picking paths  consensus

CS273a Lecture 5, Aut08, Batzoglou Quality of assemblies—mouse N50 contig length Terminology: N50 contig length If we sort contigs from largest to smallest, and start Covering the genome in that order, N50 is the length Of the contig that just covers the 50 th percentile. 7.7X sequence coverage

CS273a Lecture 5, Aut08, Batzoglou Quality of assemblies—dog 7.5X sequence coverage

CS273a Lecture 5, Aut08, Batzoglou Quality of assemblies—chimp 3.6X sequence Coverage Assisted Assembly

CS273a Lecture 5, Aut08, Batzoglou History of WGA 1982: -virus, 48,502 bp 1995: h-influenzae, 1 Mbp 2000: fly, 100 Mbp 2001 – present  human (3Gbp), mouse (2.5Gbp), rat *, chicken, dog, chimpanzee, several fungal genomes Gene Myers Let’s sequence the human genome with the shotgun strategy That is impossible, and a bad idea anyway Phil Green 1997

CS273a Lecture 5, Aut08, Batzoglou $399 Personal Genome Service $2,500 Health Compass service $985 deCODEme (November 2007) (April 2008) $350,000 Whole-genome sequencing (November 2007) Genetic Information Nondiscrimination Act (May 2008)

CS273a Lecture 5, Aut08, Batzoglou Whole-genome sequencing Comparative genomics Genome resequencing Structural variation analysis Polymorphism discovery Metagenomics Environmental sequencing Gene expression profiling Applications Genotyping Population genetics Migration studies Ancestry inference Relationship inference Genetic screening Drug targeting Forensics

CS273a Lecture 5, Aut08, Batzoglou Sequencing applications Demand for more sequencing Sequencing technology improvement Increase in sequencing data output New sequencing applications

CS273a Lecture 5, Aut08, Batzoglou Sequencing technology Sanger sequencing $10.00 $1.00 $0.10 $0.01 Cost per finished bp: Read length:15 – 200 bp500 – 1,000 bp Throughput: “grad-student years”2 ∙ 10 6 bp/day Fred Sanger

CS273a Lecture 5, Aut08, Batzoglou Sequencing technology Sanger sequencing 3 ∙ 10 9 bp 1x coverage 10x coverage 2 ∙ 10 6 bp/day = 40 years × 3 ∙ 10 9 bp 10x coverage × 3 ∙ 10 9 bp × $0.001/bp = $30 million

CS273a Lecture 5, Aut08, Batzoglou Pyrosequencing on a chip Mostafa Ronaghi, Stanford Genome Technologies Center 454 Life Sciences

CS273a Lecture 5, Aut08, Batzoglou Sequencing technology Next-generation sequencing Read length:250 bp Throughput:300 Mb/day Cost: ~ 10,000 bp/$ De novo:yes Genome Sequencer / FLX “short reads”

CS273a Lecture 5, Aut08, Batzoglou Single Molecule Array for Genotyping—Solexa

CS273a Lecture 5, Aut08, Batzoglou Polony Sequencing

CS273a Lecture 5, Aut08, Batzoglou Sequencing technology Next-generation sequencing Read length: ~ 35 bp Throughput:300 – 500 Mb/day Cost: ~ 100,000 bp/$ De novo:yes Genome AnalyzerSOLiD Analyzer “microreads”

CS273a Lecture 5, Aut08, Batzoglou Molecular Inversion Probes

CS273a Lecture 5, Aut08, Batzoglou Illumina Genotype Arrays

CS273a Lecture 5, Aut08, Batzoglou Sequencing technology Next-generation sequencing Read length:1 bp Throughput:1 – 2 Mb/day Cost:5,000 bp/$ De novo:no Infinium AssayGeneChip Array genotypes “SNP chips”

CS273a Lecture 5, Aut08, Batzoglou Nanopore Sequencing

CS273a Lecture 5, Aut08, Batzoglou Sequencing technology Next-generation sequencing

CS273a Lecture 5, Aut08, Batzoglou Sequencing technology TechnologyRead length (bp) Throughput (Mb/day) Cost (bp/$) De novo Sanger1, ,000 Solexa / ABI ,000 SNP chip125,000 ApplicationSanger454Solexa/ABI SNP chip Bacterial sequencing$ sometimes Mammalian sequencing$$$ not likely today Mammalian resequencing$$$$sort of Metagenomics$ ? Genotyping$$$ ?