Sequence Alignment: Mo1va1on and Algorithms. Lecture 2: August 23, 2012
|
|
- Alexis Butler
- 6 years ago
- Views:
Transcription
1 Sequence Alignment: Mo1va1on and Algorithms Lecture 2: August 23, 2012
2 Mo1va1on and Introduc1on
3 Importance of Sequence Alignment For DNA, RNA and amino acid sequences, high sequence similarity usually implies significant func1onal or structural similarity. imply structure from the sequence similarity suggest gene func1on Frequently, we aren t interested in exact matches of the sequences but approximate matches.
4 In- exact Alignment Where is GATTACA approximately in the human genome? And how do we efficiently find them? It depends on: (a) The defini1on of approximately Hamming Distance, Edit distance, or Sequence Similarity (b) Efficiency depends on the data characteris1cs and goals
5 In this lecture Sequence alignment and alignment sozware are used all over bioinforma1cs for different purposes. Your results will depend highly on your choice of alignment sozware. The goal of this lecture is to understand sequence alignment, mo1vate it in the context of assembly, and seeing what sozware is out there.
6 In this lecture Sequence alignment and alignment sozware are used all over bioinforma1cs for different purposes. Your results will depend highly on your choice of alignment sozware. The goal of this lecture is to understand sequence alignment, mo1vate it in the context of assembly, and seeing what sozware is out there.
7 What is a reference genome? A reference genome is a representa1ve example of a species set of genes. As they are ozen assembled from the sequencing of DNA from a number of donors, reference genomes do not accurately represent the set of genes of any individual. BUT the reference is very, very, VERY similar in many loca1ons to the individual.
8 Sample Prepara*on 8
9 Sample Prepara*on Fragments 9
10 Sample Prepara*on Fragments Sequencing Next Generation Sequencing (NGS) ACGTAGAATCGACCATG ACGTAGAATACGTAGAA GGGACGTAGAATACGAC Reads 10
11 Sample Prepara*on Fragments Sequencing Reads Assembly ACGTAGAATACGTAGAA ACGTAGAATCGACCATG GGGACGTAGAATACGAC ACGTAGAATACGTAGAAACAGATTAGAGAG Contigs 11
12 Sample Prepara*on Fragments Sequencing Reads Assembly ACGTAGAATACGTAGAA ACGTAGAATCGACCATG GGGACGTAGAATACGAC BUT WE DON T HAVE TO BEGIN FROM SCRATCH!!! ACGTAGAATACGTAGAAACAGATTAGAGAG Contigs 12
13 How do we use the reference? The reads from the individual will be very similar but not iden1cal to the reference genome. Ideally, we would like to use the informa1on from the reference! Otherwise, we are throwing up valuable informa1on. Hence, the first step is to find where in the genome the sequences are similar to.
14 Sequence Alignment Before we can make compara1ve statements about two sequences, we have to produce a pairwise sequence alignment What is the op1mal alignment between two sequences? Match/mismatch? Gaps/extensions? Is an op1mal alignment always significant?
15 Edit Distance Levenshtein (1966) introduced edit distance between two strings as the minimum number of elementary operations (insertions, deletions, and substitutions) to transform one string into the other d(v, w): the minimum number of operations required to transform v into w.
16 Edit Distance vs Hamming Distance Hamming distance always compares the i th leder of v with the j th leder of w V = ATATATAT! W = TATATATA! Edit distance may compare the i th leder of v with the j th leder of w V = -ATATATAT! W = TATATATA-! d(v, w)=8 computing Hamming distance is a trivial task d(v, w)=2 computing edit distance is a non-trivial task
17 Edit Distance vs Hamming Distance Hamming distance always compares the i th leder of v with the j th leder of w V = ATATATAT! W = TATATATA! Edit distance may compare the i th leder of v with the j th leder of w V = -ATATATAT! W = TATATATA-! d(v, w)=8 d(v, w)=2 (one insertion and one deletion) How to find what j goes with what i such that the score of the alignment is op1mized?
18 Edit Distance: Example TGCATAT ATCCGAT in 5 steps TGCATAT (delete last T) TGCATA (delete last A) TGCAT (insert A at front) ATGCAT (subs1tute C for 3 rd G) ATCCAT (insert G before last A) ATCCGAT (Done)
19 Compu1ng Edit Distance
20 Dynamic Programming Algorithm Dynamic Programming is a method for solving complex problems by breaking them down into simpler subproblems. Provides the best (op1mal) alignment between two sequences. Includes matches, mismatches, and gaps to maximize the number of matched characters. Score: match, mismatch, gap (affine vs. non- affine)
21 Dynamic Programming Visualized A T _ G T T A T _ A T C G T _ A _ C Corresponding path (0,0), (1,1), (2,2), (2,3), (3,4), (4,5), (5,5), (6,6), (7,6), (7,7)
22 Dynamic Programming Visualized and represent indels in v and w with score 0. represent matches with score 1. The score of the alignment path is 5.
23 Dynamic Programming Visualized Every path in the edit graph corresponds to an alignment:
24 Score for match: +1 Score for mismatch: 0 Score for gap: 0 Define Rules Let s i,j be the total score at posi1on i, j then we have that it is equal to the maximum of {s i- 1, j (if v i = w j ), s i- 1, j (otherwise: gap or mismatch)}
25 Dynamic Programming Example Ini1alize 1 st row and 1 st column to be all zeroes. Or, to be more precise, ini1alize 0 th row and 0 th column to be all zeroes.
26 Dynamic Programming Example S i,j = maximum of : S i-1, j-1 S i-1, j S i, j-1 value from NW +1, if v i = w j value from North (top) value from West (left)
27 Alignment: Backtracking Arrows show where the score originated. if from the top if from the lez if v i = w j
28 Backtracking Example Find a match in row and column 2. i=2, j=2,5 is a match (T). j=2, i=4,5,7 is a match (T). Since v i = w j, s i,j = s i-1,j-1 +1 s 2,2 = [s 1,1 = 1] + 1 s 2,5 = [s 1,4 = 1] + 1 s 4,2 = [s 3,1 = 1] + 1 s 5,2 = [s 4,1 = 1] + 1 s 7,2 = [s 6,1 = 1] + 1
29 Backtracking Example Con1nuing with the dynamic programming algorithm gives this result.
30 Scoring Matrices The alignment score represent odds of obtaining that score between sequences known to be related to that obtained by chance alignment between unrelated sequences When the correct scoring matrix is used, alignment sta1s1cs are meaningful Different scoring schemes for DNA and protein sequences
31 Examples of Scoring Matrices Amino acid subs1tu1on matrices: PAM BLOSUM DNA subs1tu1on matrices: DNA is less conserved than protein sequences. Less effec1ve to compare coding regions at nucleo1de level.
32 Scoring Indels: Naive Approach A fixed penalty σ is given to every indel: - σ for 1 indel, - 2σ for 2 consecu1ve indels - 3σ for 3 consecu1ve indels, etc. Can be too severe penalty for a series of 100 consecu1ve indels
33 Affine Gap Penal1es A series of k indels ozen come as a single event rather than a series of k single nucleo1de events: This is more likely. Normal scoring would give the same score for both alignments This is less likely.
34 Accoun1ng for Gaps Score for a gap of length x is - (ρ + σx), where ρ >0 is the penalty for introducing a gap: gap opening penalty ρ will be large rela1ve to σ: gap extension penalty because you do not want to add too much of a penalty for extending the gap.
35 Affine Gap Penal1es Gap penal1es: - ρ- σ when there is 1 indel - ρ- 2σ when there are 2 indels - ρ- 3σ when there are 3 indels, etc. - ρ- x σ (- gap opening - x gap extensions) Somehow reduced penal1es (as compared to naïve scoring) are given to runs of horizontal and ver1cal edges
36 Heuris1c Algorithms Make reasonable assump1ons about nature of sequence alignments and try out only most likely alignments Full perfect match (word, k- tuple) Much faster than DP algorithms but less sensi1ve Extend alignment un1l: one or the other sequence ends score drops below a threshold
37 Exis1ng Tools
38 Different Sequence Alignment Database Search: BLAST, FASTA, HMMER Mul1ple Sequence Alignment: ClustalW, FSA Genomic Analysis: BLAT Short Read Sequence Alignment: BWA, BowAe, drfast, GSNAP, SHRiMP, SOAP, MAQ
39 BLAST Basic Local Alignment Search Tool BLAST is faster than Smith- Waterman (DP algorithm), it cannot guarantee the op1mal alignments of the query and database sequences. A BLAST search enables a researcher to compare a query sequence with a library or database of sequences and iden1fy library sequences that resemble the query sequence above a certain threshold. Different types of BLASTs are available according to the query sequences.
40 Blast Versions BLASTN: Compares a nucleo1de query to a nucleo1de database BLASTP: Compares a protein query to a protein database BLASTX: Compares a translated nucleo1de query to protein database TBLASTN: Compares a protein query to a translated nucleo1de database TBLASTX: Compares a translated nucleo1de query to a translated nucleo1de database
41 hip://blast.ncbi.nlm.nih.gov/
42 Typical Uses of BLAST Which bacterial species have a protein that is related in lineage to a certain protein with known amino- acid sequence? Where does a certain sequence of DNA originate? What other genes encode proteins that exhibit structures or mo1fs such as ones thtat have been determined?
43 Mul1ple Alignment A mul1ple sequence alignment is a sequence alignment of three or more biological sequences (protein, DNA, RNA) The query sequences are assumed to have some sort of evolu1onary rela1onship by which they share some sort of lineage Many tools are available but this is a really complex computa1onal problem Used in phylogene1cs
44 Short Read Alignment SW BowAe: memory- efficient short read aligner. It aligns short DNA sequences (reads) to the human genome at a rate of over 25 million 35- bp reads per hours Burrows- Wheeler Aligner (BWA): an aliger that implements two algorithms: bwa- short and BWA- SW. The former works for query sequences shorter than 200bp and the lader for longer sequences up to around 100kbp.
45 Sequence Alignment/Map Format Sequence Reads Alignment SoMware SAM File Resequencing RNA Seq SNPs
46 SAM format A tab- delimited text format consis1ng of a header sec1on, which is op1onal, and an alignment sec1on Example VN:1.0 SN:1 LN: AS:NCBI37 UR:file:/data/local/ref/GATK/human_g1k_v37.fasta SN:2 LN: AS:NCBI37 UR:file:/data/local/ref/GATK/human_g1k_v37.fasta SN:3 LN: AS:NCBI37 UR:file:/data/local/ref/GATK/human_g1k_v37.fasta ID:UM0098:1 PL:ILLUMINA PU:HWUSI-EAS LHAAXX-L001 LB:80 DT: T20:00: SM:SD37 Example Alignments: 1:497:R: M17D24M M CGGGTCTGACCTGAGGAGAACTGTGCTCCGCCTTCAG 0;==-==9;>>>>>=>>>>>>>>>>>=>>>>>>>>>> XT:A:U NM:i:0 SM:i:37 AM:i:0 X0:i:1 X1:i:0 XM:i:0 XO:i:0 XG:i:0 MD:Z:37 19:20389:F:275+18M2D19M M = TATGACTGCTAATAATACCTACACATGTTAGAACCAT >>>>>>>>>>>>>>>>>>>><<>>><<>>4::>>:<9 RG:Z:UM0098:1 XT:A:R NM:i:0 SM:i:0 AM:i:0 X0:i:4 X1:i:0 XM:i:0 XO:i:0 XG:i:0 MD:Z:37 19:20389:F:275+18M2D19M M2D19M = GTAGTACCAACTGTAAGTCCTTATCTTCATACTTTGT ;44999;499<8<8<<<8<<><<<<><7<;<<<>><< XT:A:R NM:i:2 SM:i:0 AM:i:0 X0:i:4 X1:i:0 XM:i:0 XO:i:1 XG:i:2 MD:Z:18^CA19 9: M2I25M:R: M2I27M = CACCACATCACATATACCAAGCCTGGCTGTGTCTTCT <;9<<5><<<<><<<>><<><>><9>><>>>9>>><> XT:A:R NM:i:2 SM:i:0 AM:i:0 X0:i:5 X1:i:0 XM:i:0 XO:i:1 XG:i:2 MD:Z:35
47 The Alignment Column
48 Bitwise Flags FLAG: bitwise FLAG. Each bit is explained in the following table:
49 Bitwise Representa1on 1 = paired- end read 2 = mapped as proper pair 4 = unmapped read 8 = read mate unmapped 16 = read mapped on reverse strand Example: The flag = (condi1ons 1, 2, 8) Flags 0, 4, and 16 are the flags most commonly used.
50 Mapping Quality Phred score, iden1cal to the quality measure in the fastq file. quality Q, probability P: P = 10 ^ (- Q / 10.0) If Q=30, P=1/1000 on average, one of out 1000 alignments will be wrong As good as this sounds it is not easy to compute such a quality.
51 Mapping Quality The repeat structure of the reference. Reads falling in repe11ve regions usually get very low mapping quality The base quality of the read. Low quality means the observed read sequence is possibly wrong, and wrong sequence may lead to a wrong alignment The sensi1vity of the alignment algorithm. The true hit is more likely to be missed by an algorithm with low sensi1vity, which also causes mapping errors Paired end or not. Reads mapped in pairs are more likely to be correct
52 BWA Specific High Scores A read alignment with a mapping quality 30 or above usually implies: The overall base quality of the read is good. The best alignment has few mismatches. The read has few or just one good hit on the reference, which means the current alignment is s1ll the best even if one or two bases are actually muta1ons or sequencing errors.
53 BWA Specific Low Scores Surprisingly difficult to track down the exact behavior Q=0 if a read can be aligned equally well to mul1ple posi1ons, BWA will randomly pick one posi1on and give it a mapping quality zero. Q=25 the edit distance equals mismatches and is greater than zero
54 Using Short Read Alignment SoZware
Sequence Alignment: Mo1va1on and Algorithms
Sequence Alignment: Mo1va1on and Algorithms Mo1va1on and Introduc1on Importance of Sequence Alignment For DNA, RNA and amino acid sequences, high sequence similarity usually implies significant func1onal
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 informationModule: Sequence Alignment Theory and Applica8ons Session: BLAST
Module: Sequence Alignment Theory and Applica8ons Session: BLAST Learning Objec8ves and Outcomes v Understand the principles of the BLAST algorithm v Understand the different BLAST algorithms, parameters
More informationRead Mapping and Variant Calling
Read Mapping and Variant Calling Whole Genome Resequencing Sequencing mul:ple individuals from the same species Reference genome is already available Discover varia:ons in the genomes between and within
More informationBasic Local Alignment Search Tool (BLAST)
BLAST 26.04.2018 Basic Local Alignment Search Tool (BLAST) BLAST (Altshul-1990) is an heuristic Pairwise Alignment composed by six-steps that search for local similarities. The most used access point to
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 informationNGS Data and Sequence Alignment
Applications and Servers SERVER/REMOTE Compute DB WEB Data files NGS Data and Sequence Alignment SSH WEB SCP Manpreet S. Katari App Aug 11, 2016 Service Terminal IGV Data files Window Personal Computer/Local
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 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 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 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 informationDatabase Similarity Searching
Database Similarity Searching Why search databases? To find out if a new DNA sequence shares similari?es with sequences already deposited in the databanks. To find proteins homologous to a puta?ve coding
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 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 informationFinding sequence similarities with genes of known function is a common approach to infer a newly sequenced gene s function
Outline DNA Sequence Comparison: First Success Stories Change Problem Manhattan Tourist Problem Longest Paths in Graphs Sequence Alignment Edit Distance Longest Common Subsequence Problem Dot Matrices
More informationBioinformatics. Sequence alignment BLAST Significance. Next time Protein Structure
Bioinformatics Sequence alignment BLAST Significance Next time Protein Structure 1 Experimental origins of sequence data The Sanger dideoxynucleotide method F Each color is one lane of an electrophoresis
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 informationBasics on bioinforma-cs Lecture 4. Concita Cantarella
Basics on bioinforma-cs Lecture 4 Concita Cantarella concita.cantarella@entecra.it; concita.cantarella@gmail.com Why compare sequences Sequence comparison is a way of arranging the sequences of DNA, RNA
More informationDatabase Searching Using BLAST
Mahidol University Objectives SCMI512 Molecular Sequence Analysis Database Searching Using BLAST Lecture 2B After class, students should be able to: explain the FASTA algorithm for database searching explain
More informationBLAST & Genome assembly
BLAST & Genome assembly Solon P. Pissis Tomáš Flouri Heidelberg Institute for Theoretical Studies May 15, 2014 1 BLAST What is BLAST? The algorithm 2 Genome assembly De novo assembly Mapping assembly 3
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 informationHigh-throughput sequencing: Alignment and related topic. Simon Anders EMBL Heidelberg
High-throughput sequencing: Alignment and related topic Simon Anders EMBL Heidelberg Established platforms HTS Platforms Illumina HiSeq, ABI SOLiD, Roche 454 Newcomers: Benchtop machines 454 GS Junior,
More informationMar%n Norling. Uppsala, November 15th 2016
Mar%n Norling Uppsala, November 15th 2016 What can we do with an assembly? Since we can never know the actual sequence, or its varia%ons, valida%ng an assembly is tricky. But once you ve used all the assemblers,
More informationHigh-throughput sequencing: Alignment and related topic. Simon Anders EMBL Heidelberg
High-throughput sequencing: Alignment and related topic Simon Anders EMBL Heidelberg Established platforms HTS Platforms Illumina HiSeq, ABI SOLiD, Roche 454 Newcomers: Benchtop machines: Illumina MiSeq,
More informationSequence mapping and assembly. Alistair Ward - Boston College
Sequence mapping and assembly Alistair Ward - Boston College Sequenced a genome? Fragmented a genome -> DNA library PCR amplification Sequence reads (ends of DNA fragment for mate pairs) We no longer have
More informationFile Formats: SAM, BAM, and CRAM. UCD Genome Center Bioinformatics Core Tuesday 15 September 2015
File Formats: SAM, BAM, and CRAM UCD Genome Center Bioinformatics Core Tuesday 15 September 2015 / BAM / CRAM NEW! http://samtools.sourceforge.net/ - deprecated! http://www.htslib.org/ - SAMtools 1.0 and
More informationShort Read Alignment. Mapping Reads to a Reference
Short Read Alignment Mapping Reads to a Reference Brandi Cantarel, Ph.D. & Daehwan Kim, Ph.D. BICF 05/2018 Introduction to Mapping Short Read Aligners DNA vs RNA Alignment Quality Pitfalls and Improvements
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 informationPairwise Sequence Alignment. Zhongming Zhao, PhD
Pairwise Sequence Alignment Zhongming Zhao, PhD Email: zhongming.zhao@vanderbilt.edu http://bioinfo.mc.vanderbilt.edu/ Sequence Similarity match mismatch A T T A C G C G T A C C A T A T T A T G C G A T
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 informationSequence alignment theory and applications Session 3: BLAST algorithm
Sequence alignment theory and applications Session 3: BLAST algorithm Introduction to Bioinformatics online course : IBT Sonal Henson Learning Objectives Understand the principles of the BLAST algorithm
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 informationIntroduction to Computational Molecular Biology
18.417 Introduction to Computational Molecular Biology Lecture 13: October 21, 2004 Scribe: Eitan Reich Lecturer: Ross Lippert Editor: Peter Lee 13.1 Introduction We have been looking at algorithms to
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 informationLecture 12. Short read aligners
Lecture 12 Short read aligners Ebola reference genome We will align ebola sequencing data against the 1976 Mayinga reference genome. We will hold the reference gnome and all indices: mkdir -p ~/reference/ebola
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 informationBGGN 213 Foundations of Bioinformatics Barry Grant
BGGN 213 Foundations of Bioinformatics Barry Grant http://thegrantlab.org/bggn213 Recap From Last Time: 25 Responses: https://tinyurl.com/bggn213-02-f17 Why ALIGNMENT FOUNDATIONS Why compare biological
More informationSequence Alignment. GBIO0002 Archana Bhardwaj University of Liege
Sequence Alignment GBIO0002 Archana Bhardwaj University of Liege 1 What is Sequence Alignment? A sequence alignment is a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity.
More informationSAM : Sequence Alignment/Map format. A TAB-delimited text format storing the alignment information. A header section is optional.
Alignment of NGS reads, samtools and visualization Hands-on Software used in this practical BWA MEM : Burrows-Wheeler Aligner. A software package for mapping low-divergent sequences against a large reference
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 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 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 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 informationSequencing. Short Read Alignment. Sequencing. Paired-End Sequencing 6/10/2010. Tobias Rausch 7 th June 2010 WGS. ChIP-Seq. Applied Biosystems.
Sequencing Short Alignment Tobias Rausch 7 th June 2010 WGS RNA-Seq Exon Capture ChIP-Seq Sequencing Paired-End Sequencing Target genome Fragments Roche GS FLX Titanium Illumina Applied Biosystems SOLiD
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 informationWilson Leung 01/03/2018 An Introduction to NCBI BLAST. Prerequisites: Detecting and Interpreting Genetic Homology: Lecture Notes on Alignment
An Introduction to NCBI BLAST Prerequisites: Detecting and Interpreting Genetic Homology: Lecture Notes on Alignment Resources: The BLAST web server is available at https://blast.ncbi.nlm.nih.gov/blast.cgi
More informationSequence Alignment. GS , Introduc8on to Bioinforma8cs The University of Texas GSBS program, Fall 2013
Sequence Alignment GS 011143, Introduc8on to Bioinforma8cs The University of Texas GSBS program, Fall 2013 Ken Chen, Ph.D. Department of Bioinforma8cs and Computa8onal Biology UT MD Anderson Cancer Center
More informationThe SAM Format Specification (v1.3 draft)
The SAM Format Specification (v1.3 draft) The SAM Format Specification Working Group July 15, 2010 1 The SAM Format Specification SAM stands for Sequence Alignment/Map format. It is a TAB-delimited text
More informationPPI Network Alignment Advanced Topics in Computa8onal Genomics
PPI Network Alignment 02-715 Advanced Topics in Computa8onal Genomics PPI Network Alignment Compara8ve analysis of PPI networks across different species by aligning the PPI networks Find func8onal orthologs
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 informationCISC 636 Computational Biology & Bioinformatics (Fall 2016)
CISC 636 Computational Biology & Bioinformatics (Fall 2016) Sequence pairwise alignment Score statistics: E-value and p-value Heuristic algorithms: BLAST and FASTA Database search: gene finding and annotations
More informationRNA-seq. Manpreet S. Katari
RNA-seq Manpreet S. Katari Evolution of Sequence Technology Normalizing the Data RPKM (Reads per Kilobase of exons per million reads) Score = R NT R = # of unique reads for the gene N = Size of the gene
More informationNext generation sequencing: assembly by mapping reads. Laurent Falquet, Vital-IT Helsinki, June 3, 2010
Next generation sequencing: assembly by mapping reads Laurent Falquet, Vital-IT Helsinki, June 3, 2010 Overview What is assembly by mapping? Methods BWT File formats Tools Issues Visualization Discussion
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 informationTCCAGGTG-GAT TGCAAGTGCG-T. Local Sequence Alignment & Heuristic Local Aligners. Review: Probabilistic Interpretation. Chance or true homology?
Local Sequence Alignment & Heuristic Local Aligners Lectures 18 Nov 28, 2011 CSE 527 Computational Biology, Fall 2011 Instructor: Su-In Lee TA: Christopher Miles Monday & Wednesday 12:00-1:20 Johnson Hall
More informationHigh-throughout sequencing and using short-read aligners. Simon Anders
High-throughout sequencing and using short-read aligners Simon Anders High-throughput sequencing (HTS) Sequencing millions of short DNA fragments in parallel. a.k.a.: next-generation sequencing (NGS) massively-parallel
More informationB L A S T! BLAST: Basic local alignment search tool. Copyright notice. February 6, Pairwise alignment: key points. Outline of tonight s lecture
February 6, 2008 BLAST: Basic local alignment search tool B L A S T! Jonathan Pevsner, Ph.D. Introduction to Bioinformatics pevsner@jhmi.edu 4.633.0 Copyright notice Many of the images in this powerpoint
More informationINTRODUCTION AUX FORMATS DE FICHIERS
INTRODUCTION AUX FORMATS DE FICHIERS Plan. Formats de séquences brutes.. Format fasta.2. Format fastq 2. Formats d alignements 2.. Format SAM 2.2. Format BAM 4. Format «Variant Calling» 4.. Format Varscan
More informationHeuristic methods for pairwise alignment:
Bi03c_1 Unit 03c: Heuristic methods for pairwise alignment: k-tuple-methods k-tuple-methods for alignment of pairs of sequences Bi03c_2 dynamic programming is too slow for large databases Use heuristic
More informationMapping NGS reads for genomics studies
Mapping NGS reads for genomics studies Valencia, 28-30 Sep 2015 BIER Alejandro Alemán aaleman@cipf.es Genomics Data Analysis CIBERER Where are we? Fastq Sequence preprocessing Fastq Alignment BAM Visualization
More informationFrom Smith-Waterman to BLAST
From Smith-Waterman to BLAST Jeremy Buhler July 23, 2015 Smith-Waterman is the fundamental tool that we use to decide how similar two sequences are. Isn t that all that BLAST does? In principle, it is
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 informationCS 284A: Algorithms for Computational Biology Notes on Lecture: BLAST. The statistics of alignment scores.
CS 284A: Algorithms for Computational Biology Notes on Lecture: BLAST. The statistics of alignment scores. prepared by Oleksii Kuchaiev, based on presentation by Xiaohui Xie on February 20th. 1 Introduction
More informationUnder the Hood of Alignment Algorithms for NGS Researchers
Under the Hood of Alignment Algorithms for NGS Researchers April 16, 2014 Gabe Rudy VP of Product Development Golden Helix Questions during the presentation Use the Questions pane in your GoToWebinar window
More informationThe SAM Format Specification (v1.3-r837)
The SAM Format Specification (v1.3-r837) The SAM Format Specification Working Group November 18, 2010 1 The SAM Format Specification SAM stands for Sequence Alignment/Map format. It is a TAB-delimited
More informationNGS Data Analysis. Roberto Preste
NGS Data Analysis Roberto Preste 1 Useful info http://bit.ly/2r1y2dr Contacts: roberto.preste@gmail.com Slides: http://bit.ly/ngs-data 2 NGS data analysis Overview 3 NGS Data Analysis: the basic idea http://bit.ly/2r1y2dr
More informationAlignments BLAST, BLAT
Alignments BLAST, BLAT Genome Genome Gene vs Built of DNA DNA Describes Organism Protein gene Stored as Circular/ linear Single molecule, or a few of them Both (depending on the species) Part of genome
More informationCOS 551: Introduction to Computational Molecular Biology Lecture: Oct 17, 2000 Lecturer: Mona Singh Scribe: Jacob Brenner 1. Database Searching
COS 551: Introduction to Computational Molecular Biology Lecture: Oct 17, 2000 Lecturer: Mona Singh Scribe: Jacob Brenner 1 Database Searching In database search, we typically have a large sequence database
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 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 informationSequence alignment algorithms
Sequence alignment algorithms Bas E. Dutilh Systems Biology: Bioinformatic Data Analysis Utrecht University, February 23 rd 27 After this lecture, you can decide when to use local and global sequence alignments
More informationSimilarity searches in biological sequence databases
Similarity searches in biological sequence databases Volker Flegel september 2004 Page 1 Outline Keyword search in databases General concept Examples SRS Entrez Expasy Similarity searches in databases
More informationBLAST: Basic Local Alignment Search Tool Altschul et al. J. Mol Bio CS 466 Saurabh Sinha
BLAST: Basic Local Alignment Search Tool Altschul et al. J. Mol Bio. 1990. CS 466 Saurabh Sinha Motivation Sequence homology to a known protein suggest function of newly sequenced protein Bioinformatics
More informationChapter 4: Blast. Chaochun Wei Fall 2014
Course organization Introduction ( Week 1-2) Course introduction A brief introduction to molecular biology A brief introduction to sequence comparison Part I: Algorithms for Sequence Analysis (Week 3-11)
More informationWilson Leung 05/27/2008 A Simple Introduction to NCBI BLAST
A Simple Introduction to NCBI BLAST Prerequisites: Detecting and Interpreting Genetic Homology: Lecture Notes on Alignment Resources: The BLAST web server is available at http://www.ncbi.nih.gov/blast/
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 informationINTRODUCTION TO BIOINFORMATICS
Molecular Biology-2019 1 INTRODUCTION TO BIOINFORMATICS In this section, we want to provide a simple introduction to using the web site of the National Center for Biotechnology Information NCBI) to obtain
More informationNGS Analysis Using Galaxy
NGS Analysis Using Galaxy Sequences and Alignment Format Galaxy overview and Interface Get;ng Data in Galaxy Analyzing Data in Galaxy Quality Control Mapping Data History and workflow Galaxy Exercises
More informationIntroduction to Phylogenetics Week 2. Databases and Sequence Formats
Introduction to Phylogenetics Week 2 Databases and Sequence Formats I. Databases Crucial to bioinformatics The bigger the database, the more comparative research data Requires scientists to upload data
More informationINTRODUCTION TO BIOINFORMATICS
Molecular Biology-2017 1 INTRODUCTION TO BIOINFORMATICS In this section, we want to provide a simple introduction to using the web site of the National Center for Biotechnology Information NCBI) to obtain
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 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 informationSequence comparison: Local alignment
Sequence comparison: Local alignment Genome 559: Introuction to Statistical an Computational Genomics Prof. James H. Thomas http://faculty.washington.eu/jht/gs559_217/ Review global alignment en traceback
More informationAlgorithms in Bioinformatics: A Practical Introduction. Database Search
Algorithms in Bioinformatics: A Practical Introduction Database Search Biological databases Biological data is double in size every 15 or 16 months Increasing in number of queries: 40,000 queries per day
More informationSequence analysis Pairwise sequence alignment
UMF11 Introduction to bioinformatics, 25 Sequence analysis Pairwise sequence alignment 1. Sequence alignment Lecturer: Marina lexandersson 12 September, 25 here are two types of sequence alignments, global
More informationReconstructing long sequences from overlapping sequence fragment. Searching databases for related sequences and subsequences
SEQUENCE ALIGNMENT ALGORITHMS 1 Why compare sequences? Reconstructing long sequences from overlapping sequence fragment Searching databases for related sequences and subsequences Storing, retrieving and
More informationDynamic Programming Part I: Examples. Bioinfo I (Institut Pasteur de Montevideo) Dynamic Programming -class4- July 25th, / 77
Dynamic Programming Part I: Examples Bioinfo I (Institut Pasteur de Montevideo) Dynamic Programming -class4- July 25th, 2011 1 / 77 Dynamic Programming Recall: the Change Problem Other problems: Manhattan
More informationPerl for Biologists. Session 8. April 30, Practical examples. (/home/jarekp/perl_08) Jon Zhang
Perl for Biologists Session 8 April 30, 2014 Practical examples (/home/jarekp/perl_08) Jon Zhang Session 8: Examples CBSU Perl for Biologists 1.1 1 Review of Session 7 Regular expression: a specific pattern
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 informationRCAC. Job files Example: Running seqyclean (a module)
RCAC Job files Why? When you log into an RCAC server you are using a special server designed for multiple users. This is called a frontend node ( or sometimes a head node). There are (I think) three front
More informationMetaPhyler Usage Manual
MetaPhyler Usage Manual Bo Liu boliu@umiacs.umd.edu March 13, 2012 Contents 1 What is MetaPhyler 1 2 Installation 1 3 Quick Start 2 3.1 Taxonomic profiling for metagenomic sequences.............. 2 3.2
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 informationBrief review from last class
Sequence Alignment Brief review from last class DNA is has direction, we will use only one (5 -> 3 ) and generate the opposite strand as needed. DNA is a 3D object (see lecture 1) but we will model it
More informationRead Mapping. Slides by Carl Kingsford
Read Mapping Slides by Carl Kingsford Bowtie Ultrafast and memory-efficient alignment of short DNA sequences to the human genome Ben Langmead, Cole Trapnell, Mihai Pop and Steven L Salzberg, Genome Biology
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 informationRNA-Seq in Galaxy: Tuxedo protocol. Igor Makunin, UQ RCC, QCIF
RNA-Seq in Galaxy: Tuxedo protocol Igor Makunin, UQ RCC, QCIF Acknowledgments Genomics Virtual Lab: gvl.org.au Galaxy for tutorials: galaxy-tut.genome.edu.au Galaxy Australia: galaxy-aust.genome.edu.au
More informationBIOL591: Introduction to Bioinformatics Alignment of pairs of sequences
BIOL591: Introduction to Bioinformatics Alignment of pairs of sequences Reading in text (Mount Bioinformatics): I must confess that the treatment in Mount of sequence alignment does not seem to me a model
More informationBioinformatics in next generation sequencing projects
Bioinformatics in next generation sequencing projects Rickard Sandberg Assistant Professor Department of Cell and Molecular Biology Karolinska Institutet March 2011 Once sequenced the problem becomes computational
More informationWelcome to MAPHiTS (Mapping Analysis Pipeline for High-Throughput Sequences) tutorial page.
Welcome to MAPHiTS (Mapping Analysis Pipeline for High-Throughput Sequences) tutorial page. In this page you will learn to use the tools of the MAPHiTS suite. A little advice before starting : rename your
More informationSlopMap: a software application tool for quick and flexible identification of similar sequences using exact k-mer matching
SlopMap: a software application tool for quick and flexible identification of similar sequences using exact k-mer matching Ilya Y. Zhbannikov 1, Samuel S. Hunter 1,2, Matthew L. Settles 1,2, and James
More information