Biostrings. Martin Morgan Bioconductor / Fred Hutchinson Cancer Research Center Seattle, WA, USA June 2009
|
|
- Morris Conley
- 5 years ago
- Views:
Transcription
1 Biostrings Martin Morgan Bioconductor / Fred Hutchinson Cancer Research Center Seattle, WA, USA June 2009
2 Biostrings Representation DNA, RNA, amino acid, and general biological strings Manipulation Sequence summary Pattern matching Views and masks Genomes, via BSgenome Example tasks 1. Remap microarray probes 2. Identify and remove short read contaminants 3. Align reads to a custom-masked genome
3 Representation Type One Several DNA DNAString DNAStringSet RNA RNAString RNAStringSet Amino acid AAString AAStringSet Biological BString BStringSet
4 Creating objects I > library(biostrings) > DNAString() 0-letter "DNAString" instance seq: > DNAString("ACACGACT") 8-letter "DNAString" instance seq: ACACGACT > alphabet(dnastring()) # IUPAC [1] "A" "C" "G" "T" "M" "R" "W" "S" "Y" "K" [11] "V" "H" "D" "B" "N" "-" "+" > try(dnastring("e")) # error
5 Creating objects II > data(phix174phage) > phix174phage A DNAStringSet instance of length 6 width seq names [1] 5386 GAGTTT...CTGCA Genbank [2] 5386 GAGTTT...CTGCA RF70s [3] 5386 GAGTTT...CTGCA SS78 [4] 5386 GAGTTT...CTGCA Bull [5] 5386 GAGTTT...CTGCA G97 [6] 5386 GAGTTT...CTGCA NEB03 > gb <- phix174phage[["genbank"]] # or [[1]] > gb 5386-letter "DNAString" instance seq: GAGTTTTATCGCTTCCATG...TGGCGTATCCAACCTGCA
6 Manipulation Input / Output read.dnastringset, write.xstringset Description alphabet valid letters alphabetfrequency, dinucleotidefrequency nucleotide and dinucleotide counts Transformation reverse, complement, reversecomplement chartr translate character, e.g., C to T
7 Manipulation: examples > gb 5386-letter "DNAString" instance seq: GAGTTTTATCGCTTCCATG...TGGCGTATCCAACCTGCA > reversecomplement(gb) 5386-letter "DNAString" instance seq: TGCAGGTTGGATACGCCAA...ATGGAAGCGATAAAACTC > alphabetfrequency(gb) A C G T M R W S Y K V H D B N > dinucleotidefrequency(gb) AA AC AG AT CA CC CG CT GA GC GG GT TA TC TG TT
8 Subsequences, views, and masks Subsequences: copying sequences Constructors (e.g., DNAString) subseq Views Motivation: wasteful to copy large read-only strings Views Masks Motivation: exclude well-defined regions from consideration for analysis maskmotif, mask
9 Subsequences and views I > subseq(phix174phage, start = 2800, + end = 2820) A DNAStringSet instance of length 6 width seq names [1] 21 CCGGGC...ATGTT Genbank [2] 21 CCGGGC...ATGTT RF70s [3] 21 CCGGGC...ATGTT SS78 [4] 21 CCGGGC...ATGTT Bull [5] 21 CCGGGC...ATGTT G97 [6] 21 CCGGGC...ATGTT NEB03 > Views(gb, start = 2800, end = 2820) Views on a 5386-letter DNAString subject subject: GAGTTTTATCGCTTCCA...GCGTATCCAACCTGCA views: start end width [1] [CCGGGCAATAACGTTTATGTT]
10 Subsequences and views II > width <- 25 > starts <- round(runif(1000, 1, nchar(gb) - + width)) > gbv <- Views(gb, start = starts, width = width) > length(gbv) [1] 1000 > head(gbv, 3) Views on a 5386-letter DNAString subject subject: GAGTTTTATCGCTTCCA...GCGTATCCAACCTGCA views: start end width [1] [ATTCTGTGCC...CTTTGTTCC] [2] [CTGAGACTGA...TCGCCAAAT] [3] [CCTACAGGTA...ACCCTAATT]
11 Masks > gb 5386-letter "DNAString" instance seq: GAGTTTTATCGCTTCCATG...TGGCGTATCCAACCTGCA > (gbm <- maskmotif(gb, "TTTT")) 5386-letter "MaskedDNAString" instance (# for masking) seq: GAG####ATCGCTTCCATG...TGGCGTATCCAACCTGCA masks: maskedwidth maskedratio active desc TRUE TTTT-blocks > alphabetfrequency(gb, baseonly = TRUE) A C G T other > alphabetfrequency(gbm, baseonly = TRUE) A C G T other
12 Pattern matching Terminology pattern: subsequence or pattern being looked for subject: string being searched Types of match Exact: pattern is identical to subsequence(s) of subject Mismatch: substitutions between pattern and subject Indel: gap opening and extension Alignemnts Global, local, ends-free,... Scoring scheme for mismatches, insertions and deletions edit distance
13 Types of alignment Example: align pattern succeed to subject supersede Global (Needleman-Wunch) Align entire sequences, e.g., pattern: succe--ed subject: sup-ersed Local (Smith-Waterman) Best alignment of portion of a sequence pattern: su subject: su Ends-free / overlap Restricted to right end of subject and left end of pattern, or vice versa
14 Edit distance Alignment scores: penalities for Mismatch Constant, e.g., PAM / BLOSUM Probability-based, e.g., resolving IUPAC ambiguities Gap opening and extension Linear: extension only Affine: opening and extension Edit distance Score summed over the alignment E.g., Levenshtein edit distance: Mismatch -1 Gap opening 0 Gap extension -1
15 Position weight matrix Matrix of weights for each nucleotide, at several positions Useful for, e.g., motif-finding > pwm <- rbind( + A=c( 1, 0, 19, 20, 18, 1, 20, 7), + C=c( 1, 0, 1, 0, 1, 18, 0, 2), + G=c(17, 0, 0, 0, 1, 0, 0, 3), + T=c( 1, 20, 0, 0, 0, 1, 0, 8))
16 Pattern matching in Biostrings All matches of pattern in subject Subject One Many Pattern One matchpattern vmatchpattern countpattern vcountpattern Many matchpdict??? vcountpdict pairwisealignment: global (Needleman-Wunch), local (Smith-Waternman), and overlap (ends-free) alignments matchpwm: position weight matrix-defined motifs Special-purpose: trimlrpatterns, matchprobepair, findpalindromes
17 Genome representations Motivation: mechanism for representing and manipulating large, unchanging representations Model organism BSgenome packages already exist Custom BSgenome packages can be created Often contain masks, e.g., RepeatMasker > library(bsgenome) > available.genomes() > library(bsgenome.hsapiens.ucsc.hg19) > Hsapiens > Hsapiens[["chr1"]]
18 Example: remapping probes > library(hgu95av2probe) > library(bsgenome.hsapiens.ucsc.hg19) > dict <- PDict(hgu95av2probe[["sequence"]]) > subj <- unmasked(hsapiens[["chr1"]]) > m <- matchpdict(dict, subj) > m[[700]] INCOMPLETE: match to all chromosomes; see vignette
19 Example: trimming adapters > pcrprimer <- "GGACTACCVGGGTATCTAAT" > trimmed <- trimlrpatterns(pcrprimer, + subject = sread(aln), max.lmismatch = 2, + Lfixed = FALSE) Trim PCR primer pcrprimer from left end of AlignedRead object aln, allowing up to two mismatches and IUPAC ambiguity in the primer
20 Summary Biostrings Representations for large or numerous biological sequences Convenient manipulations Extensive and flexible pattern matching Biostrings vignettes are extensive, e.g., alignments, genome manipulations
An introduction to the Biostrings/BSgenome framework
An introduction to the Biostrings/BSgenome framework Hervé Pagès and Patrick Aboyoun Computational Biology Program Fred Hutchinson Cancer Research Center Containers for representing large biological sequences
More informationBiostrings/BSgenome Lab (BioC2009)
Biostrings/BSgenome Lab (BioC2009) Hervé Pagès and Patrick Aboyoun Fred Hutchinson Cancer Research Center Seattle, WA July 26, 2009 1 Lab overview Learn the basics of Biostrings and the BSgenome data packages.
More informationBiostrings Lab (BioC2008)
Biostrings Lab (BioC2008) H. Pagès Gentleman Lab Fred Hutchinson Cancer Research Center Seattle, WA July 31, 2008 1 Lab overview 1.1 Goals Learn the basics of the Biostrings package and how to use it together
More informationAn overview of the Biostrings/BSgenome framework
...ACGAGATTTATGATGATCGGATTATACGACACCGATCGGCCATATGATTAC... An overview of the Biostrings/BSgenome framework Hervé Pagès Computational Biology Program Fred Hutchinson Cancer Research Center...ACGAGATTTATGATGATCGGATTATACGACACCGATCGGCCATATGATTAC...
More informationA tour in the Biostrings/BSgenome/IRanges framework. Hervé Pagès Computational Biology Program Fred Hutchinson Cancer Research Center
A tour in the Biostrings/BSgenome/IRanges framework Hervé Pagès Computational Biology Program Fred Hutchinson Cancer Research Center Containers for representing large biological sequences (DNA/RNA/amino
More informationIntroduction to Biocondcutor tools for second-generation sequencing analysis
Introduction to Biocondcutor tools for second-generation sequencing analysis Héctor Corrada Bravo based on slides developed by James Bullard, Kasper Hansen and Margaret Taub PASI, Guanajuato, México May
More informationSequence Alignment of Short Read Data using Biostrings
Sequence Alignment of Short Read Data using Biostrings Patrick Aboyoun Fred Hutchinson Cancer Research Center Seattle, WA 98008 22 January 2009 Contents 1 Introduction 1 2 Setup 2 3 Finding Possible Contaminants
More informationSequence Alignment of Short Read Data using Biostrings
Sequence Alignment of Short Read Data using Biostrings Patrick Aboyoun Fred Hutchinson Cancer Research Center Seattle, WA 98008 18 November 2009 Contents 1 Introduction 1 2 Setup 3 3 Pattern and PWM Matching
More informationBioconductor packages for short read analyses
Bioconductor packages for short read analyses RNA-Seq / ChIP-Seq Data Analysis Workshop 10 September 2012 CSC, Helsinki Nicolas Delhomme Foreword The core packages for integrating NGS data analysis represents
More informationComputational Genomics and Molecular Biology, Fall
Computational Genomics and Molecular Biology, Fall 2015 1 Sequence Alignment Dannie Durand Pairwise Sequence Alignment The goal of pairwise sequence alignment is to establish a correspondence between the
More informationManaging big biological sequence data with Biostrings and DECIPHER. Erik Wright University of Wisconsin-Madison
Managing big biological sequence data with Biostrings and DECIPHER Erik Wright University of Wisconsin-Madison What you should learn How to use the Biostrings and DECIPHER packages Creating a database
More informationThe Biostrings 2 classes (work in progress)
The Biostrings 2 classes (work in progress) Hervé Pagès October 30, 2017 Contents 1 Introduction 1 2 The XString class and its subsetting operator [ 2 3 The == binary operator for XString objects 3 4 The
More informationGeneR. JORGE ARTURO ZEPEDA MARTINEZ LOPEZ HERNANDEZ JOSE FABRICIO. October 6, 2009
GeneR JORGE ARTURO ZEPEDA MARTINEZ LOPEZ HERNANDEZ JOSE FABRICIO. jzepeda@lcg.unam.mx jlopez@lcg.unam.mx October 6, 2009 Abstract GeneR packages allow direct use of nucleotide sequences within R software.
More informationUsing oligonucleotide microarray reporter sequence information for preprocessing and quality assessment
Using oligonucleotide microarray reporter sequence information for preprocessing and quality assessment Wolfgang Huber and Robert Gentleman April 30, 2018 Contents 1 Overview 1 2 Using probe packages 1
More informationAn Introduction to ShortRead
Martin Morgan Modified: 21 October, 2013. Compiled: April 30, 2018 > library("shortread") The ShortRead package provides functionality for working with FASTQ files from high throughput sequence analysis.
More informationRepresenting sequencing data in Bioconductor
Representing sequencing data in Bioconductor Mark Dunning mark.dunning@cruk.cam.ac.uk Last modified: July 28, 2015 Contents 1 Accessing Genome Sequence 1 1.1 Alphabet Frequencies...................................
More informationMultipleAlignment Objects
MultipleAlignment Objects Marc Carlson Bioconductor Core Team Fred Hutchinson Cancer Research Center Seattle, WA April 30, 2018 Contents 1 Introduction 1 2 Creation and masking 1 3 Analytic utilities 7
More informationFinding homologous sequences in databases
Finding homologous sequences in databases There are multiple algorithms to search sequences databases BLAST (EMBL, NCBI, DDBJ, local) FASTA (EMBL, local) For protein only databases scan via Smith-Waterman
More informationAnalysis of high-throughput sequencing data. Simon Anders EBI
Analysis of high-throughput sequencing data Simon Anders EBI Outline Overview on high-throughput sequencing (HTS) technologies, focusing on Solexa's GenomAnalyzer as example Software requirements to works
More informationDynamic Programming User Manual v1.0 Anton E. Weisstein, Truman State University Aug. 19, 2014
Dynamic Programming User Manual v1.0 Anton E. Weisstein, Truman State University Aug. 19, 2014 Dynamic programming is a group of mathematical methods used to sequentially split a complicated problem into
More informationCompares a sequence of protein to another sequence or database of a protein, or a sequence of DNA to another sequence or library of DNA.
Compares a sequence of protein to another sequence or database of a protein, or a sequence of DNA to another sequence or library of DNA. Fasta is used to compare a protein or DNA sequence to all of the
More informationBiology 644: Bioinformatics
Find the best alignment between 2 sequences with lengths n and m, respectively Best alignment is very dependent upon the substitution matrix and gap penalties The Global Alignment Problem tries to find
More informationPairwise Sequence Alignments
Pairwise Sequence Alignments Patrick Aboyoun Gentleman Lab Fred Hutchinson Cancer Research Center Seattle, WA October 30, 2017 Contents 1 Introduction 2 2 Pairwise Sequence Alignment Problems 2 3 Main
More informationDarwin: A Genomic Co-processor gives up to 15,000X speedup on long read assembly (To appear in ASPLOS 2018)
Darwin: A Genomic Co-processor gives up to 15,000X speedup on long read assembly (To appear in ASPLOS 2018) Yatish Turakhia EE PhD candidate Stanford University Prof. Bill Dally (Electrical Engineering
More informationFASTA. Besides that, FASTA package provides SSEARCH, an implementation of the optimal Smith- Waterman algorithm.
FASTA INTRODUCTION Definition (by David J. Lipman and William R. Pearson in 1985) - Compares a sequence of protein to another sequence or database of a protein, or a sequence of DNA to another sequence
More informationPackage muscle. R topics documented: March 7, Type Package
Type Package Package muscle March 7, 2019 Title Multiple Sequence Alignment with MUSCLE Version 3.24.0 Date 2012-10-05 Author Algorithm by Robert C. Edgar. R port by Alex T. Kalinka. Maintainer Alex T.
More informationBMI/CS 576 Fall 2015 Midterm Exam
BMI/CS 576 Fall 2015 Midterm Exam Prof. Colin Dewey Tuesday, October 27th, 2015 11:00am-12:15pm Name: KEY Write your answers on these pages and show your work. You may use the back sides of pages as necessary.
More informationUsing seqtools package
Using seqtools package Wolfgang Kaisers, CBiBs HHU Dusseldorf October 30, 2017 1 seqtools package The seqtools package provides functionality for collecting and analyzing quality measures from FASTQ files.
More informationCentral Issues in Biological Sequence Comparison
Central Issues in Biological Sequence Comparison Definitions: What is one trying to find or optimize? Algorithms: Can one find the proposed object optimally or in reasonable time optimize? Statistics:
More information10 things (maybe) you didn t know about GenomicRanges, Biostrings, and Rsamtools
10 things (maybe) you didn t know about GenomicRanges, Biostrings, and Rsamtools Hervé Pagès hpages@fredhutch.org June 2016 1. Inner vs outer metadata columns > mcols(grl)$id
More informationLecture 3: February Local Alignment: The Smith-Waterman Algorithm
CSCI1820: Sequence Alignment Spring 2017 Lecture 3: February 7 Lecturer: Sorin Istrail Scribe: Pranavan Chanthrakumar Note: LaTeX template courtesy of UC Berkeley EECS dept. Notes are also adapted from
More informationLecture Overview. Sequence search & alignment. Searching sequence databases. Sequence Alignment & Search. Goals: Motivations:
Lecture Overview Sequence Alignment & Search Karin Verspoor, Ph.D. Faculty, Computational Bioscience Program University of Colorado School of Medicine With credit and thanks to Larry Hunter for creating
More informationLecture 5 Advanced BLAST
Introduction to Bioinformatics for Medical Research Gideon Greenspan gdg@cs.technion.ac.il Lecture 5 Advanced BLAST BLAST Recap Sequence Alignment Complexity and indexing BLASTN and BLASTP Basic parameters
More informationSequence Alignment & Search
Sequence Alignment & Search Karin Verspoor, Ph.D. Faculty, Computational Bioscience Program University of Colorado School of Medicine With credit and thanks to Larry Hunter for creating the first version
More informationSequence alignment is an essential concept for bioinformatics, as most of our data analysis and interpretation techniques make use of it.
Sequence Alignments Overview Sequence alignment is an essential concept for bioinformatics, as most of our data analysis and interpretation techniques make use of it. Sequence alignment means arranging
More informationPackage FastqCleaner
Type Package Package FastqCleaner April 8, 2019 Title A Shiny Application for Quality Control, Filtering and Trimming of FASTQ Files Version 1.1.0 Date 2018-05-19 Maintainer An interactive web application
More informationTutorial. Find Very Low Frequency Variants With QIAGEN GeneRead Panels. Sample to Insight. November 21, 2017
Find Very Low Frequency Variants With QIAGEN GeneRead Panels November 21, 2017 Sample to Insight QIAGEN Aarhus Silkeborgvej 2 Prismet 8000 Aarhus C Denmark Telephone: +45 70 22 32 44 www.qiagenbioinformatics.com
More informationPrinciples of Bioinformatics. BIO540/STA569/CSI660 Fall 2010
Principles of Bioinformatics BIO540/STA569/CSI660 Fall 2010 Lecture 11 Multiple Sequence Alignment I Administrivia Administrivia The midterm examination will be Monday, October 18 th, in class. Closed
More informationLecture 5: Markov models
Master s course Bioinformatics Data Analysis and Tools Lecture 5: Markov models Centre for Integrative Bioinformatics Problem in biology Data and patterns are often not clear cut When we want to make a
More information.. Fall 2011 CSC 570: Bioinformatics Alexander Dekhtyar..
.. Fall 2011 CSC 570: Bioinformatics Alexander Dekhtyar.. PAM and BLOSUM Matrices Prepared by: Jason Banich and Chris Hoover Background As DNA sequences change and evolve, certain amino acids are more
More informationExercises: Reading and Manipulating Short Reads
Exercises: Reading and Manipulating Short Reads Martin Morgan 29-30 July, 2010 Contents 1 Introduction 1 2 Aligned read input 2 2.1 Navigating Solexa output...................... 2 2.2 readaligned and
More informationLecture 2 Pairwise sequence alignment. Principles Computational Biology Teresa Przytycka, PhD
Lecture 2 Pairwise sequence alignment. Principles Computational Biology Teresa Przytycka, PhD Assumptions: Biological sequences evolved by evolution. Micro scale changes: For short sequences (e.g. one
More informationToday s Lecture. Multiple sequence alignment. Improved scoring of pairwise alignments. Affine gap penalties Profiles
Today s Lecture Multiple sequence alignment Improved scoring of pairwise alignments Affine gap penalties Profiles 1 The Edit Graph for a Pair of Sequences G A C G T T G A A T G A C C C A C A T G A C G
More informationBioinformatics for Biologists
Bioinformatics for Biologists Sequence Analysis: Part I. Pairwise alignment and database searching Fran Lewitter, Ph.D. Director Bioinformatics & Research Computing Whitehead Institute Topics to Cover
More informationImportant Example: Gene Sequence Matching. Corrigiendum. Central Dogma of Modern Biology. Genetics. How Nucleotides code for Amino Acids
Important Example: Gene Sequence Matching Century of Biology Two views of computer science s relationship to biology: Bioinformatics: computational methods to help discover new biology from lots of data
More informationComputational Molecular Biology
Computational Molecular Biology Erwin M. Bakker Lecture 3, mainly from material by R. Shamir [2] and H.J. Hoogeboom [4]. 1 Pairwise Sequence Alignment Biological Motivation Algorithmic Aspect Recursive
More informationBLAST MCDB 187. Friday, February 8, 13
BLAST MCDB 187 BLAST Basic Local Alignment Sequence Tool Uses shortcut to compute alignments of a sequence against a database very quickly Typically takes about a minute to align a sequence against a database
More informationAs of August 15, 2008, GenBank contained bases from reported sequences. The search procedure should be
48 Bioinformatics I, WS 09-10, S. Henz (script by D. Huson) November 26, 2009 4 BLAST and BLAT Outline of the chapter: 1. Heuristics for the pairwise local alignment of two sequences 2. BLAST: search and
More informationWeighted Finite-State Transducers in Computational Biology
Weighted Finite-State Transducers in Computational Biology Mehryar Mohri Courant Institute of Mathematical Sciences mohri@cims.nyu.edu Joint work with Corinna Cortes (Google Research). 1 This Tutorial
More informationIdentiyfing splice junctions from RNA-Seq data
Identiyfing splice junctions from RNA-Seq data Joseph K. Pickrell pickrell@uchicago.edu October 4, 2010 Contents 1 Motivation 2 2 Identification of potential junction-spanning reads 2 3 Calling splice
More informationSequence Alignment (chapter 6) p The biological problem p Global alignment p Local alignment p Multiple alignment
Sequence lignment (chapter 6) p The biological problem p lobal alignment p Local alignment p Multiple alignment Local alignment: rationale p Otherwise dissimilar proteins may have local regions of similarity
More informationGlobal Alignment Scoring Matrices Local Alignment Alignment with Affine Gap Penalties
Global Alignment Scoring Matrices Local Alignment Alignment with Affine Gap Penalties From LCS to Alignment: Change the Scoring The Longest Common Subsequence (LCS) problem the simplest form of sequence
More informationQIAseq DNA V3 Panel Analysis Plugin USER MANUAL
QIAseq DNA V3 Panel Analysis Plugin USER MANUAL User manual for QIAseq DNA V3 Panel Analysis 1.0.1 Windows, Mac OS X and Linux January 25, 2018 This software is for research purposes only. QIAGEN Aarhus
More informationSAPLING: Suffix Array Piecewise Linear INdex for Genomics Michael Kirsche
SAPLING: Suffix Array Piecewise Linear INdex for Genomics Michael Kirsche mkirsche@jhu.edu StringBio 2018 Outline Substring Search Problem Caching and Learned Data Structures Methods Results Ongoing work
More informationCLC Server. End User USER MANUAL
CLC Server End User USER MANUAL Manual for CLC Server 10.0.1 Windows, macos and Linux March 8, 2018 This software is for research purposes only. QIAGEN Aarhus Silkeborgvej 2 Prismet DK-8000 Aarhus C Denmark
More information24 Grundlagen der Bioinformatik, SS 10, D. Huson, April 26, This lecture is based on the following papers, which are all recommended reading:
24 Grundlagen der Bioinformatik, SS 10, D. Huson, April 26, 2010 3 BLAST and FASTA This lecture is based on the following papers, which are all recommended reading: D.J. Lipman and W.R. Pearson, Rapid
More informationICB Fall G4120: Introduction to Computational Biology. Oliver Jovanovic, Ph.D. Columbia University Department of Microbiology
ICB Fall 2008 G4120: Computational Biology Oliver Jovanovic, Ph.D. Columbia University Department of Microbiology Copyright 2008 Oliver Jovanovic, All Rights Reserved. The Digital Language of Computers
More informationBiostrings. April 20, AAString objects. An AAString object allows efficient storage and manipulation of a long amino acid sequence.
Biostrings April 20, 2011 AAString-class AAString objects Description Details An AAString object allows efficient storage and manipulation of a long amino acid sequence. The AAString class is a direct
More informationGraph Algorithms in Bioinformatics
Graph Algorithms in Bioinformatics Computational Biology IST Ana Teresa Freitas 2015/2016 Sequencing Clone-by-clone shotgun sequencing Human Genome Project Whole-genome shotgun sequencing Celera Genomics
More informationEECS730: Introduction to Bioinformatics
EECS730: Introduction to Bioinformatics Lecture 04: Variations of sequence alignments http://www.pitt.edu/~mcs2/teaching/biocomp/tutorials/global.html Slides adapted from Dr. Shaojie Zhang (University
More informationSequencing. Computational Biology IST Ana Teresa Freitas 2011/2012. (BACs) Whole-genome shotgun sequencing Celera Genomics
Computational Biology IST Ana Teresa Freitas 2011/2012 Sequencing Clone-by-clone shotgun sequencing Human Genome Project Whole-genome shotgun sequencing Celera Genomics (BACs) 1 Must take the fragments
More informationBLAST, Profile, and PSI-BLAST
BLAST, Profile, and PSI-BLAST Jianlin Cheng, PhD School of Electrical Engineering and Computer Science University of Central Florida 26 Free for academic use Copyright @ Jianlin Cheng & original sources
More informationLecture 10. Sequence alignments
Lecture 10 Sequence alignments Alignment algorithms: Overview Given a scoring system, we need to have an algorithm for finding an optimal alignment for a pair of sequences. We want to maximize the score
More informationAlignment of Long Sequences
Alignment of Long Sequences BMI/CS 776 www.biostat.wisc.edu/bmi776/ Spring 2009 Mark Craven craven@biostat.wisc.edu Pairwise Whole Genome Alignment: Task Definition Given a pair of genomes (or other large-scale
More informationBioinformatics explained: BLAST. March 8, 2007
Bioinformatics Explained Bioinformatics explained: BLAST March 8, 2007 CLC bio Gustav Wieds Vej 10 8000 Aarhus C Denmark Telephone: +45 70 22 55 09 Fax: +45 70 22 55 19 www.clcbio.com info@clcbio.com Bioinformatics
More informationA Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm
A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm GARY BENSON, YOZEN HERNANDEZ, & JOSHUA LOVING B I O I N F O R M A T I C S P R O G R A M B O S T O N U N I V E R S I T Y J L O V I N
More informationLong Read RNA-seq Mapper
UNIVERSITY OF ZAGREB FACULTY OF ELECTRICAL ENGENEERING AND COMPUTING MASTER THESIS no. 1005 Long Read RNA-seq Mapper Josip Marić Zagreb, February 2015. Table of Contents 1. Introduction... 1 2. RNA Sequencing...
More informationAlgorithmic Approaches for Biological Data, Lecture #20
Algorithmic Approaches for Biological Data, Lecture #20 Katherine St. John City University of New York American Museum of Natural History 20 April 2016 Outline Aligning with Gaps and Substitution Matrices
More informationBLAST & Genome assembly
BLAST & Genome assembly Solon P. Pissis Tomáš Flouri Heidelberg Institute for Theoretical Studies November 17, 2012 1 Introduction Introduction 2 BLAST What is BLAST? The algorithm 3 Genome assembly De
More informationEECS 4425: Introductory Computational Bioinformatics Fall Suprakash Datta
EECS 4425: Introductory Computational Bioinformatics Fall 2018 Suprakash Datta datta [at] cse.yorku.ca Office: CSEB 3043 Phone: 416-736-2100 ext 77875 Course page: http://www.cse.yorku.ca/course/4425 Many
More informationSequence Alignment 1
Sequence Alignment 1 Nucleotide and Base Pairs Purine: A and G Pyrimidine: T and C 2 DNA 3 For this course DNA is double-helical, with two complementary strands. Complementary bases: Adenine (A) - Thymine
More informationCISC 889 Bioinformatics (Spring 2003) Multiple Sequence Alignment
CISC 889 Bioinformatics (Spring 2003) Multiple Sequence Alignment Courtesy of jalview 1 Motivations Collective statistic Protein families Identification and representation of conserved sequence features
More information[Parallel] processing pipelines in Python with generators/coroutines and multiprocessing
[Parallel] processing pipelines in Python with generators/coroutines and multiprocessing Example: Fastq processing utility Summaries: Qualities, base composition, redundancy,... Filters: read quality,
More informationMultiple Sequence Alignment Augmented by Expert User Constraints
Multiple Sequence Alignment Augmented by Expert User Constraints A Thesis Submitted to the College of Graduate Studies and Research in Partial Fulfillment of the Requirements for the degree of Master of
More informationBiological Sequence Matching Using Fuzzy Logic
International Journal of Scientific & Engineering Research Volume 2, Issue 7, July-2011 1 Biological Sequence Matching Using Fuzzy Logic Nivit Gill, Shailendra Singh Abstract: Sequence alignment is the
More informationFastA & the chaining problem
FastA & the chaining problem We will discuss: Heuristics used by the FastA program for sequence alignment Chaining problem 1 Sources for this lecture: Lectures by Volker Heun, Daniel Huson and Knut Reinert,
More informationPairwise Sequence Alignment: Dynamic Programming Algorithms. COMP Spring 2015 Luay Nakhleh, Rice University
Pairwise Sequence Alignment: Dynamic Programming Algorithms COMP 571 - Spring 2015 Luay Nakhleh, Rice University DP Algorithms for Pairwise Alignment The number of all possible pairwise alignments (if
More informationHML Data Dictionary :24:16 CDT
HML Data Dictionary 2011-06-22 16:24:16 CDT Table of Contents HML Data Dictionary...1 HML Version 0.3.3...2 HML Version 0.3...8 HML Version 0.2...9 Specialized Data Types...12 NMDP ID...12 Center Code...12
More informationFastA and the chaining problem, Gunnar Klau, December 1, 2005, 10:
FastA and the chaining problem, Gunnar Klau, December 1, 2005, 10:56 4001 4 FastA and the chaining problem We will discuss: Heuristics used by the FastA program for sequence alignment Chaining problem
More informationNotes on Dynamic-Programming Sequence Alignment
Notes on Dynamic-Programming Sequence Alignment Introduction. Following its introduction by Needleman and Wunsch (1970), dynamic programming has become the method of choice for rigorous alignment of DNA
More informationSept. 9, An Introduction to Bioinformatics. Special Topics BSC5936:
Special Topics BSC5936: An Introduction to Bioinformatics. Florida State University The Department of Biological Science www.bio.fsu.edu Sept. 9, 2003 The Dot Matrix Method Steven M. Thompson Florida State
More informationSimilarity Searches on Sequence Databases
Similarity Searches on Sequence Databases Lorenza Bordoli Swiss Institute of Bioinformatics EMBnet Course, Zürich, October 2004 Swiss Institute of Bioinformatics Swiss EMBnet node Outline Importance of
More informationPackage Biostrings. November 21, 2017
Title Efficient manipulation of biological strings Package Biostrings November 21, 2017 Description Memory efficient string containers, string matching algorithms, and other utilities, for fast manipulation
More informationGeneR Package. L. Cottret, A. Lucas, O. Rogier, E. Marrakchi, V. Lefort, P. Durosay, A. Viari, C. Thermes & Y. d Aubenton-Carafa October 18, 2010
GeneR Package L. Cottret, A. Lucas, O. Rogier, E. Marrakchi, V. Lefort, P. Durosay, A. Viari, C. Thermes & Y. d Aubenton-Carafa October 18, 2010 Contents 1 Overview 1 2 Installation 2 3 Quick Start 2 4
More informationResearch Article An Improved Scoring Matrix for Multiple Sequence Alignment
Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2012, Article ID 490649, 9 pages doi:10.1155/2012/490649 Research Article An Improved Scoring Matrix for Multiple Sequence Alignment
More informationPROTEIN MULTIPLE ALIGNMENT MOTIVATION: BACKGROUND: Marina Sirota
Marina Sirota MOTIVATION: PROTEIN MULTIPLE ALIGNMENT To study evolution on the genetic level across a wide range of organisms, biologists need accurate tools for multiple sequence alignment of protein
More informationMouse, Human, Chimpanzee
More Alignments 1 Mouse, Human, Chimpanzee Mouse to Human Chimpanzee to Human 2 Mouse v.s. Human Chromosome X of Mouse to Human 3 Local Alignment Given: two sequences S and T Find: substrings of S and
More informationLectures by Volker Heun, Daniel Huson and Knut Reinert, in particular last years lectures
4 FastA and the chaining problem We will discuss: Heuristics used by the FastA program for sequence alignment Chaining problem 4.1 Sources for this lecture Lectures by Volker Heun, Daniel Huson and Knut
More informationSequence Assembly Required!
Sequence Assembly Required! 1 October 3, ISMB 20172007 1 Sequence Assembly Genome Sequenced Fragments (reads) Assembled Contigs Finished Genome 2 Greedy solution is bounded 3 Typical assembly strategy
More informationPackage BSgenome. December 19, 2017
Package BSgenome December 19, 2017 Title Software infrastructure for efficient representation of full genomes and their SNPs Description Infrastructure shared by all the Biostrings-based genome data packages.
More informationRsubread package: high-performance read alignment, quantification and mutation discovery
Rsubread package: high-performance read alignment, quantification and mutation discovery Wei Shi 14 September 2015 1 Introduction This vignette provides a brief description to the Rsubread package. For
More informationPre-processing and quality control of sequence data. Barbera van Schaik KEBB - Bioinformatics Laboratory
Pre-processing and quality control of sequence data Barbera van Schaik KEBB - Bioinformatics Laboratory b.d.vanschaik@amc.uva.nl Topic: quality control and prepare data for the interesting stuf Keep Throw
More informationPairwise alignment II
Pairwise alignment II Agenda - Previous Lesson: Minhala + Introduction - Review Dynamic Programming - Pariwise Alignment Biological Motivation Today: - Quick Review: Sequence Alignment (Global, Local,
More informationComputational Molecular Biology
Computational Molecular Biology Erwin M. Bakker Lecture 2 Materials used from R. Shamir [2] and H.J. Hoogeboom [4]. 1 Molecular Biology Sequences DNA A, T, C, G RNA A, U, C, G Protein A, R, D, N, C E,
More informationOmega: an Overlap-graph de novo Assembler for Metagenomics
Omega: an Overlap-graph de novo Assembler for Metagenomics B a h l e l H a i d e r, Ta e - H y u k A h n, B r i a n B u s h n e l l, J u a n j u a n C h a i, A l e x C o p e l a n d, C h o n g l e Pa n
More informationDynamic Programming & Smith-Waterman algorithm
m m Seminar: Classical Papers in Bioinformatics May 3rd, 2010 m m 1 2 3 m m Introduction m Definition is a method of solving problems by breaking them down into simpler steps problem need to contain overlapping
More informationRsubread package: high-performance read alignment, quantification and mutation discovery
Rsubread package: high-performance read alignment, quantification and mutation discovery Wei Shi 14 September 2015 1 Introduction This vignette provides a brief description to the Rsubread package. For
More informationRESEARCH TOPIC IN BIOINFORMANTIC
RESEARCH TOPIC IN BIOINFORMANTIC GENOME ASSEMBLY Instructor: Dr. Yufeng Wu Noted by: February 25, 2012 Genome Assembly is a kind of string sequencing problems. As we all know, the human genome is very
More informationGetting Started DECIPHERing
Getting Started DECIPHERing Erik S. Wright April 30, 2018 Contents 1 About DECIPHER 1 2 Design Philosophy 2 2.1 Curators Protect the Originals................................... 2 2.2 Don t Reinvent the
More informationCMSC423: Bioinformatic Algorithms, Databases and Tools Lecture 8. Note
MS: Bioinformatic lgorithms, Databases and ools Lecture 8 Sequence alignment: inexact alignment dynamic programming, gapped alignment Note Lecture 7 suffix trees and suffix arrays will be rescheduled Exact
More information