# Pairwise Sequence Alignment

Size: px
Start display at page:

## Transcription

1 Pairwise Sequence Alignment Stuart M. Brown NYU School of Medicine w/ slides byfourie Joubert

2 Protein Evolution For many protein sequences, evolutionary history can be traced back 1-2 billion years -William Pearson When we align sequences, we assume that they share a common ancestor They are then homologous Protein fold is much more conserved than protein sequence DNA sequences tend to be less informative than protein sequences

3 Definition Homology: related by descent Homologous sequence positions ATTGCGC! ATTGCGC! C à ATTGCGC à ATCCGC à ATTGCGC AT-CCGC

4 Orthologous and paralogous Orthologous sequences differ because they are found in different species (a speciation event) Paralogous sequences differ due to a gene duplication event Sequences may be both orthologous and paralogous

5 Pairwise Alignment The alignment of two sequences (DNA or protein) is a relatively straightforward computational problem. There are lots of possible alignments. Two sequences can always be aligned. Sequence alignments have to be scored. Often there is more than one solution with the same score.

6 Methods of Alignment By hand - slide sequences on two lines of a word processor Dot plot with windows Rigorous mathematical approach Dynamic programming (slow, optimal) Heuristic methods (fast, approximate) BLAST and FASTA Word matching and hash tables0

7 Align by Hand GATCGCCTA_TTACGTCCTGGAC <-- --> AGGCATACGTA_GCCCTTTCGC You still need some kind of scoring system to find the best alignment

8 An Introduction to Bioinformatics Algorithms Percent Sequence Identity The extent to which two nucleotide or amino acid sequences are invariant A C C T G A G A G A C G T G G C A G mismatch 70% identical indel

9 Dotplot: A dotplot gives an overview of all possible alignments Sequence 2 A l l l l T l l l l T l l l l C l l l A l l l l C l l l A l l l l T l l l l A l l l l T A C A T T A C G T A C Sequence 1

10 Dotplot: In a dotplot each diagonal corresponds to a possible (ungapped) alignment Sequence 2 A l l l l T l l l l T l l l l C l l l A l l l l C l l l A l l l l T l l l l A l l l l T A C A T T A C G T A C Sequence 1 One possible alignment: T A C A T T A C G T A C A T A C A C T T A

11 Insertions / Deletions in a Dotplot Sequence 2 T A C T G T C A T T A C T G T T C A T Sequence 1 T A C T G - T C A T T A C T G T T C A T

12 Dotplot (Window = 130 / Stringency = 9) Hemoglobin β-chain Hemoglobin α-chain

13 Word Size Algorithm T A C G G T A T G A C A G T A T C Word Size = 3 T A C G G T A T G A C A G T A T C T A C G G T A T G A C A G T A T C T A C G G T A T G A C A G T A T C C T A T G A C A T A C G G T A T G

14 Window / Stringency Score = 11 PTHPLASKTQILPEDLASEDLTI PTHPLAGERAIGLARLAEEDFGM Scoring Matrix Filtering Score = 11 PTHPLASKTQILPEDLASEDLTI PTHPLAGERAIGLARLAEEDFGM Score = 7 PTHPLASKTQILPEDLASEDLTI PTHPLAGERAIGLARLAEEDFGM Matrix: PAM250 Window = 12 Stringency = 9

15 Dotplot (Window = 18 / Stringency = 10) Hemoglobin β-chain Hemoglobin α-chain

16 Considerations The window/stringency method is more sensitive than the wordsize method (ambiguities are permitted). The smaller the window, the larger the weight of statistical (unspecific) matches. With large windows the sensitivity for short sequences is reduced. Insertions/deletions are not treated explicitly.

17 Alignment methods Rigorous algorithms = Dynamic Programming Needleman-Wunsch (global) Smith-Waterman (local) Heuristic algorithms (faster but approximate) BLAST FASTA

18 Basic principles of dynamic programming - Creation of an alignment path matrix - Stepwise calculation of score values - Backtracking (evaluation of the optimal path)

19 Dynamic Programming Dynamic Programming is a very general programming technique. " It is applicable when a large search space can be structured into a succession of stages, such that: " the initial stage contains trivial solutions to subproblems " each partial solution in a later stage can be calculated by recurring a fixed number of partial solutions in an earlier stage" the final stage contains the overall solution "

20 Creation of an alignment path matrix Idea: Build up an optimal alignment using previous solutions for optimal alignments of smaller subsequences Construct matrix F indexed by i and j (one index for each sequence) F(i,j) is the score of the best alignment between the initial segment x 1...i of x up to x i and the initial segment y 1...j of y up to y j Build F(i,j) recursively beginning with F(0,0) = 0

21

22 Creation of an alignment path matrix If F(i-1,j-1), F(i-1,j) and F(i,j-1) are known we can calculate F(i,j) Three possibilities: x i and y j are aligned, F(i,j) = F(i-1,j-1) + s(x i,y j ) x i is aligned to a gap, F(i,j) = F(i-1,j) - d y j is aligned to a gap, F(i,j) = F(i,j-1) - d The best score up to (i,j) will be the largest of the three options

23 Backtracking H E A G A W G H E E P A W H E A E Optimal global alignment: H E A G A W G H E - E -- P - A W - H E A E

24 Global vs. Local Alignments Global alignment algorithms start at the beginning of two sequences and add gaps to each until the end of one is reached. Local alignment algorithms finds the region (or regions) of highest similarity between two sequences and build the alignment outward from there.

25

26 Global Alignment Two closely related sequences: needle (Needleman & Wunsch) creates an end-to-end alignment.

27 Global Alignment Two sequences sharing several regions of local similarity: 1 AGGATTGGAATGCTCAGAAGCAGCTAAAGCGTGTATGCAGGATTGGAATTAAAGAGGAGGTAGACCG AGGATTGGAATGCTAGGCTTGATTGCCTACCTGTAGCCACATCAGAAGCACTAAAGCGTCAGCGAGACCG 70

28 Global Alignment (Needleman -Wunsch) The the Needleman-Wunsch algorithm creates a global alignment over the length of both sequences (needle) Global algorithms are often not effective for highly diverged sequences - do not reflect the biological reality that two sequences may only share limited regions of conserved sequence. Sometimes two sequences may be derived from ancient recombination events where only a single functional domain is shared. Global methods are useful when you want to force two sequences to align over their entire length

29 Local alignment Local Alignment (Smith-Waterman) Identify the most similar sub-region shared between two sequences Smith-Waterman EMBOSS: water

30 Parameters of Sequence Alignment Scoring Systems: Each symbol pairing is assigned a numerical value, based on a symbol comparison table. Gap Penalties: Opening: The cost to introduce a gap Extension: The cost to elongate a gap

31 DNA Scoring Systems -very simple Sequence 1 Sequence 2 actaccagttcatttgatacttctcaaa taccattaccgtgttaactgaaaggacttaaagact A G C T A G C T Match: 1 Mismatch: 0 Score = 5

32 Protein Scoring Systems Sequence 1 Sequence 2 PTHPLASKTQILPEDLASEDLTI PTHPLAGERAIGLARLAEEDFGM Scoring matrix C S T P A G N D.. C 9 S -1 4 T P A G N D T:G = -2 T:T = 5 Score = 48

33 Protein Scoring Systems Amino acids have different biochemical and physical properties that influence their relative replaceability in evolution. aliphatic I L C S+S V A G T P G C SH S D N tiny small hydrophobic aromatic M F Y W H K E Q R charged positive polar

34 Protein Scoring Systems Scoring matrices reflect: # of mutations to convert one to another chemical similarity observed mutation frequencies the probability of occurrence of each amino acid Widely used scoring matrices: PAM BLOSUM

35 PAM matrices Ø Family of matrices PAM 80, PAM 120, PAM 250 Ø The number with a PAM matrix represents the evolutionary distance between the sequences on which the matrix is based Ø Greater numbers denote greater distances

36 PAM (Percent Accepted Mutations) matrices The numbers of replacements were used to compute a so-called PAM-1 matrix. The PAM-1 matrix reflects an average change of 1% of all amino acid positions. PAM matrices for larger evolutionary distances can be extrapolated from the PAM-1 matrix. PAM250 = 250 mutations per 100 residues. Greater numbers mean bigger evolutionary distance.

37 PAM (Percent Accepted Mutations) matrices Derived from global alignments of protein families. Family members share at least 85% identity (Dayhoff et al., 1978). Construction of phylogenetic tree and ancestral sequences of each protein family Computation of number of replacements for each pair of amino acids

38 PAM 250 C A R N D C Q E G H I L K M F P S T W Y V B Z A R N D C Q E G H I L K M F P S T W Y V B Z W W

39 PAM - limitations Ø Based on only one original dataset Ø Examines proteins with few differences (85% identity) Ø Based mainly on small globular proteins so the matrix is biased

40 BLOSUM matrices Ø Different BLOSUMn matrices are calculated independently from BLOCKS (ungapped local alignments) Ø BLOSUMn is based on a cluster of BLOCKS of sequences that share at least n percent identity Ø BLOSUM62 represents closer sequences than BLOSUM45

41 BLOSUM (Blocks Substitution Matrix) Derived from alignments of domains of distantly related proteins (Henikoff & Henikoff,1992). A A C E C Occurrences of each amino acid pair in each column of each block alignment is counted. The numbers derived from all blocks were used to compute the BLOSUM matrices. A A C E C A - C = 4 A - E = 2 C - E = 2 A - A = 1 C - C = 1

42 An Introduction to Bioinformatics Algorithms The Blosum50 Scoring Matrix

43 BLOSUM (Blocks Substitution Matrix) Sequences within blocks are clustered according to their level of identity. Clusters are counted as a single sequence. Different BLOSUM matrices differ in the percentage of sequence identity used in clustering. The number in the matrix name (e.g. 62 in BLOSUM62) refers to the percentage of sequence identity used to build the matrix. Greater numbers mean smaller evolutionary distance.

44 PAM Vs. BLOSUM PAM100 = BLOSUM90 PAM120 = BLOSUM80 PAM160 = BLOSUM60 PAM200 = BLOSUM52 PAM250 = BLOSUM45 More distant sequences l PAM120 for general use l PAM60 for close relations l PAM250 for distant relations l BLOSUM62 for general use l BLOSUM80 for close relations l BLOSUM45 for distant relations

45 TIPS on choosing a scoring matrix Generally, BLOSUM matrices perform better than PAM matrices for local similarity searches (Henikoff & Henikoff, 1993). When comparing closely related proteins one should use lower PAM or higher BLOSUM matrices, for distantly related proteins higher PAM or lower BLOSUM matrices. For database searching the commonly used matrix is BLOSUM62.

46 Scoring Insertions and Deletions A T G T A A T G C A T A T G T G G A A T G A A T G T - - A A T G C A T A T G T G G A A T G A insertion / deletion The creation of a gap is penalized with a negative score value.

47 Why Gap Penalties? Gaps not permitted Score: 0 1 GTGATAGACACAGACCGGTGGCATTGTGG 29 1 GTGTCGGGAAGAGATAACTCCGATGGTTG 29 Match = 5 Mismatch = -4 Gaps allowed but not penalized Score: 88 1 GTG.ATAG.ACACAGA..CCGGT..GGCATTGTGG 29 1 GTGTAT.GGA.AGAGATACC..TCCG..ATGGTTG 29

48 Why Gap Penalties? The optimal alignment of two similar sequences is usually that which maximizes the number of matches and minimizes the number of gaps. There is a tradeoff between these two - adding gaps reduces mismatches Permitting the insertion of arbitrarily many gaps can lead to high scoring alignments of non-homologous sequences. Penalizing gaps forces alignments to have relatively few gaps.

49 Gap Penalties How to balance gaps with mismatches? Gaps must get a steep penalty, or else you ll end up with nonsense alignments. In real sequences, muti-base (or amino acid) gaps are quit common genetic insertion/deletion events Affine gap penalties give a big penalty for each new gap, but a much smaller gap extension penalty.

50 Scoring Insertions and Deletions match = 1 mismatch = 0 Total Score: 4 A T G T T A T A C T A T G T G C G T A T A Total Score: = 4.8 Gap parameters: d = 3 (gap opening) e = 0.1 (gap extension) g = 3 (gap lenght) A T G T T A T A C T A T G T G C G T A T A insertion / deletion γ(g) = -3 - (3-1) 0.1 = -3.2

51 Modification of Gap Penalties Score Matrix: BLOSUM62 gap opening penalty = 3 gap extension penalty = 0.1 score = 6.3 gap opening penalty = 0 gap extension penalty = 0.1 score = VLSPADKFLTNV 12 1 VFTELSPAKTV V...LSPADKFLTNV 12 1 VFTELSPA.K..T.V 11

### Pairwise Sequence Alignment

Pairwise Sequence Alignment carolin.kosiol@vetmeduni.ac.at SS 2013 Outline Pairwise sequence alignment global - Needleman Wunsch Gotoh algorithm local - Smith Waterman algorithm BLAST - heuristics What

### Sequence Analysis 15: lecture 5. Substitution matrices Multiple sequence alignment

Sequence Analysis 15: lecture 5 Substitution matrices Multiple sequence alignment A teacher's dilemma To understand... Multiple sequence alignment Substitution matrices Phylogenetic trees You first need

### Amino Acids and Their Properties

Amino Acids and Their Properties Recap: ss-rrna and mutations Ribosomal RNA (rrna) evolves very slowly Much slower than proteins ss-rrna is typically used So by aligning ss-rrna of one organism with that

### Bio-Informatics Lectures. A Short Introduction

Bio-Informatics Lectures A Short Introduction The History of Bioinformatics Sanger Sequencing PCR in presence of fluorescent, chain-terminating dideoxynucleotides Massively Parallel Sequencing Massively

### Network Protocol Analysis using Bioinformatics Algorithms

Network Protocol Analysis using Bioinformatics Algorithms Marshall A. Beddoe Marshall_Beddoe@McAfee.com ABSTRACT Network protocol analysis is currently performed by hand using only intuition and a protocol

### Introduction to Bioinformatics 3. DNA editing and contig assembly

Introduction to Bioinformatics 3. DNA editing and contig assembly Benjamin F. Matthews United States Department of Agriculture Soybean Genomics and Improvement Laboratory Beltsville, MD 20708 matthewb@ba.ars.usda.gov

### BLAST. Anders Gorm Pedersen & Rasmus Wernersson

BLAST Anders Gorm Pedersen & Rasmus Wernersson Database searching Using pairwise alignments to search databases for similar sequences Query sequence Database Database searching Most common use of pairwise

### THREE DIMENSIONAL REPRESENTATION OF AMINO ACID CHARAC- TERISTICS

THREE DIMENSIONAL REPRESENTATION OF AMINO ACID CHARAC- TERISTICS O.U. Sezerman 1, R. Islamaj 2, E. Alpaydin 2 1 Laborotory of Computational Biology, Sabancı University, Istanbul, Turkey. 2 Computer Engineering

### Similarity Searches on Sequence Databases: BLAST, FASTA. Lorenza Bordoli Swiss Institute of Bioinformatics EMBnet Course, Basel, October 2003

Similarity Searches on Sequence Databases: BLAST, FASTA Lorenza Bordoli Swiss Institute of Bioinformatics EMBnet Course, Basel, October 2003 Outline Importance of Similarity Heuristic Sequence Alignment:

### RETRIEVING SEQUENCE INFORMATION. Nucleotide sequence databases. Database search. Sequence alignment and comparison

RETRIEVING SEQUENCE INFORMATION Nucleotide sequence databases Database search Sequence alignment and comparison Biological sequence databases Originally just a storage place for sequences. Currently the

### Rapid alignment methods: FASTA and BLAST. p The biological problem p Search strategies p FASTA p BLAST

Rapid alignment methods: FASTA and BLAST p The biological problem p Search strategies p FASTA p BLAST 257 BLAST: Basic Local Alignment Search Tool p BLAST (Altschul et al., 1990) and its variants are some

### Introduction to Phylogenetic Analysis

Subjects of this lecture Introduction to Phylogenetic nalysis Irit Orr 1 Introducing some of the terminology of phylogenetics. 2 Introducing some of the most commonly used methods for phylogenetic analysis.

### Protein & DNA Sequence Analysis. Bobbie-Jo Webb-Robertson May 3, 2004

Protein & DNA Sequence Analysis Bobbie-Jo Webb-Robertson May 3, 2004 Sequence Analysis Anything connected to identifying higher biological meaning out of raw sequence data. 2 Genomic & Proteomic Data Sequence

### PROC. CAIRO INTERNATIONAL BIOMEDICAL ENGINEERING CONFERENCE 2006 1. E-mail: msm_eng@k-space.org

BIOINFTool: Bioinformatics and sequence data analysis in molecular biology using Matlab Mai S. Mabrouk 1, Marwa Hamdy 2, Marwa Mamdouh 2, Marwa Aboelfotoh 2,Yasser M. Kadah 2 1 Biomedical Engineering Department,

### BIO 3350: ELEMENTS OF BIOINFORMATICS PARTIALLY ONLINE SYLLABUS

BIO 3350: ELEMENTS OF BIOINFORMATICS PARTIALLY ONLINE SYLLABUS NEW YORK CITY COLLEGE OF TECHNOLOGY The City University Of New York School of Arts and Sciences Biological Sciences Department Course title:

### Clone Manager. Getting Started

Clone Manager for Windows Professional Edition Volume 2 Alignment, Primer Operations Version 9.5 Getting Started Copyright 1994-2015 Scientific & Educational Software. All rights reserved. The software

### BIOINFORMATICS TUTORIAL

Bio 242 BIOINFORMATICS TUTORIAL Bio 242 α Amylase Lab Sequence Sequence Searches: BLAST Sequence Alignment: Clustal Omega 3d Structure & 3d Alignments DO NOT REMOVE FROM LAB. DO NOT WRITE IN THIS DOCUMENT.

### Elementary Sequence Analysis

Last modified August 19, 2015 Brian Golding, Dick Morton and Wilfried Haerty Department of Biology McMaster University Hamilton, Ontario L8S 4K1 ii These notes are in Adobe Acrobat format (they are available

### Database searching with DNA and protein sequences: An introduction Clare Sansom Date received (in revised form): 12th November 1999

Dr Clare Sansom works part time at Birkbeck College, London, and part time as a freelance computer consultant and science writer At Birkbeck she coordinates an innovative graduate-level Advanced Certificate

### Computational searches of biological sequences

UNAM, México, Enero 78 Computational searches of biological sequences Special thanks to all the scientis that made public available their presentations throughout the web from where many slides were taken

### Using ClustalX for multiple sequence alignment

Using ClustalX for multiple sequence alignment Jarno Tuimala December 2004 All rights reserved. The PDF version of this leaflet or parts of it can be used in Finnish universities as course material, provided

### Bioinformatics Resources at a Glance

Bioinformatics Resources at a Glance A Note about FASTA Format There are MANY free bioinformatics tools available online. Bioinformaticists have developed a standard format for nucleotide and protein sequences

### DNA Insertions and Deletions in the Human Genome. Philipp W. Messer

DNA Insertions and Deletions in the Human Genome Philipp W. Messer Genetic Variation CGACAATAGCGCTCTTACTACGTGTATCG : : CGACAATGGCGCT---ACTACGTGCATCG 1. Nucleotide mutations 2. Genomic rearrangements 3.

### Using MATLAB: Bioinformatics Toolbox for Life Sciences

Using MATLAB: Bioinformatics Toolbox for Life Sciences MR. SARAWUT WONGPHAYAK BIOINFORMATICS PROGRAM, SCHOOL OF BIORESOURCES AND TECHNOLOGY, AND SCHOOL OF INFORMATION TECHNOLOGY, KING MONGKUT S UNIVERSITY

### An Introduction to Sequence Similarity ( Homology ) Searching

An Introduction to Sequence Similarity ( Homology ) Searching Gary D. Stormo 1 UNIT 3.1 1 Washington University, School of Medicine, St. Louis, Missouri ABSTRACT Homologous sequences usually have the same,

### Bioinformatics Grid - Enabled Tools For Biologists.

Bioinformatics Grid - Enabled Tools For Biologists. What is Grid-Enabled Tools (GET)? As number of data from the genomics and proteomics experiment increases. Problems arise for the current sequence analysis

### Protein Sequence Analysis - Overview -

Protein Sequence Analysis - Overview - UDEL Workshop Raja Mazumder Research Associate Professor, Department of Biochemistry and Molecular Biology Georgetown University Medical Center Topics Why do protein

### Focusing on results not data comprehensive data analysis for targeted next generation sequencing

Focusing on results not data comprehensive data analysis for targeted next generation sequencing Daniel Swan, Jolyon Holdstock, Angela Matchan, Richard Stark, John Shovelton, Duarte Mohla and Simon Hughes

### Introduction to Bioinformatics AS 250.265 Laboratory Assignment 6

Introduction to Bioinformatics AS 250.265 Laboratory Assignment 6 In the last lab, you learned how to perform basic multiple sequence alignments. While useful in themselves for determining conserved residues

### CD-HIT User s Guide. Last updated: April 5, 2010. http://cd-hit.org http://bioinformatics.org/cd-hit/

CD-HIT User s Guide Last updated: April 5, 2010 http://cd-hit.org http://bioinformatics.org/cd-hit/ Program developed by Weizhong Li s lab at UCSD http://weizhong-lab.ucsd.edu liwz@sdsc.edu 1. Introduction

Phylogenetic Trees Made Easy A How-To Manual Fourth Edition Barry G. Hall University of Rochester, Emeritus and Bellingham Research Institute Sinauer Associates, Inc. Publishers Sunderland, Massachusetts

### The Central Dogma of Molecular Biology

Vierstraete Andy (version 1.01) 1/02/2000 -Page 1 - The Central Dogma of Molecular Biology Figure 1 : The Central Dogma of molecular biology. DNA contains the complete genetic information that defines

### Developing an interactive webbased learning. environment for bioinformatics. Master thesis. Daniel Løkken Rustad UNIVERSITY OF OSLO

UNIVERSITY OF OSLO Department of Informatics Developing an interactive webbased learning environment for bioinformatics Master thesis Daniel Løkken Rustad 27th July 2005 Preface Preface This thesis is

### Worksheet - COMPARATIVE MAPPING 1

Worksheet - COMPARATIVE MAPPING 1 The arrangement of genes and other DNA markers is compared between species in Comparative genome mapping. As early as 1915, the geneticist J.B.S Haldane reported that

### BASIC STATISTICAL METHODS FOR GENOMIC DATA ANALYSIS

BASIC STATISTICAL METHODS FOR GENOMIC DATA ANALYSIS SEEMA JAGGI Indian Agricultural Statistics Research Institute Library Avenue, New Delhi-110 012 seema@iasri.res.in Genomics A genome is an organism s

### Linear Sequence Analysis. 3-D Structure Analysis

Linear Sequence Analysis What can you learn from a (single) protein sequence? Calculate it s physical properties Molecular weight (MW), isoelectric point (pi), amino acid content, hydropathy (hydrophilic

### Algorithms in Bioinformatics I, WS06/07, C.Dieterich 47. This lecture is based on the following, which are all recommended reading:

Algorithms in Bioinformatics I, WS06/07, C.Dieterich 47 5 BLAST and FASTA This lecture is based on the following, which are all recommended reading: D.J. Lipman and W.R. Pearson, Rapid and Sensitive Protein

### Multiple Sequence Alignment and Analysis: Part I An Introduction to the Theory and Application of Multiple Sequence Analysis.

Steven M. Thompson Manuscript for Multiple Sequence Alignment and Analysis Page 1 3/31/04 Multiple Sequence Alignment and Analysis: Part I An Introduction to the Theory and Application of Multiple Sequence

### Lecture 4: Exact string searching algorithms. Exact string search algorithms. Definitions. Exact string searching or matching

COSC 348: Computing for Bioinformatics Definitions A pattern (keyword) is an ordered sequence of symbols. Lecture 4: Exact string searching algorithms Lubica Benuskova http://www.cs.otago.ac.nz/cosc348/

### Molecular Databases and Tools

NWeHealth, The University of Manchester Molecular Databases and Tools Afternoon Session: NCBI/EBI resources, pairwise alignment, BLAST, multiple sequence alignment and primer finding. Dr. Georgina Moulton

### A COMPARISON OF COMPUTATION TECHNIQUES FOR DNA SEQUENCE COMPARISON

International Journal of Research in Computer Science eissn 2249-8265 Volume 2 Issue 3 (2012) pp. 1-6 White Globe Publications A COMPARISON OF COMPUTATION TECHNIQUES FOR DNA SEQUENCE COMPARISON Harshita

### Lab 2/Phylogenetics/September 16, 2002 1 PHYLOGENETICS

Lab 2/Phylogenetics/September 16, 2002 1 Read: Tudge Chapter 2 PHYLOGENETICS Objective of the Lab: To understand how DNA and protein sequence information can be used to make comparisons and assess evolutionary

### PHYLOGENETIC ANALYSIS

Bioinformatics: A Practical Guide to the Analysis of Genes and Proteins, Second Edition Andreas D. Baxevanis, B.F. Francis Ouellette Copyright 2001 John Wiley & Sons, Inc. ISBNs: 0-471-38390-2 (Hardback);

### Multiple Sequence Alignment. Hot Topic 5/24/06 Kim Walker

Multiple Sequence Alignment Hot Topic 5/24/06 Kim Walker Outline Why are Multiple Sequence Alignments useful? What Tools are Available? Brief Introduction to ClustalX Tools to Edit and Add Features to

### Bioinformatics and handwriting/speech recognition: unconventional applications of similarity search tools

Bioinformatics and handwriting/speech recognition: unconventional applications of similarity search tools Kyle Jensen and Gregory Stephanopoulos Department of Chemical Engineering, Massachusetts Institute

### Phylogenetic Analysis using MapReduce Programming Model

2015 IEEE International Parallel and Distributed Processing Symposium Workshops Phylogenetic Analysis using MapReduce Programming Model Siddesh G M, K G Srinivasa*, Ishank Mishra, Abhinav Anurag, Eklavya

### Guide for Bioinformatics Project Module 3

Structure- Based Evidence and Multiple Sequence Alignment In this module we will revisit some topics we started to look at while performing our BLAST search and looking at the CDD database in the first

### agucacaaacgcu agugcuaguuua uaugcagucuua

RNA Secondary Structure Prediction: The Co-transcriptional effect on RNA folding agucacaaacgcu agugcuaguuua uaugcagucuua By Conrad Godfrey Abstract RNA secondary structure prediction is an area of bioinformatics

### DnaSP, DNA polymorphism analyses by the coalescent and other methods.

DnaSP, DNA polymorphism analyses by the coalescent and other methods. Author affiliation: Julio Rozas 1, *, Juan C. Sánchez-DelBarrio 2,3, Xavier Messeguer 2 and Ricardo Rozas 1 1 Departament de Genètica,

### Hidden Markov Models

8.47 Introduction to omputational Molecular Biology Lecture 7: November 4, 2004 Scribe: Han-Pang hiu Lecturer: Ross Lippert Editor: Russ ox Hidden Markov Models The G island phenomenon The nucleotide frequencies

### MAKING AN EVOLUTIONARY TREE

Student manual MAKING AN EVOLUTIONARY TREE THEORY The relationship between different species can be derived from different information sources. The connection between species may turn out by similarities

### UCHIME in practice Single-region sequencing Reference database mode

UCHIME in practice Single-region sequencing UCHIME is designed for experiments that perform community sequencing of a single region such as the 16S rrna gene or fungal ITS region. While UCHIME may prove

### Genome Explorer For Comparative Genome Analysis

Genome Explorer For Comparative Genome Analysis Jenn Conn 1, Jo L. Dicks 1 and Ian N. Roberts 2 Abstract Genome Explorer brings together the tools required to build and compare phylogenies from both sequence

### Lecture 19: Proteins, Primary Struture

CPS260/BGT204.1 Algorithms in Computational Biology November 04, 2003 Lecture 19: Proteins, Primary Struture Lecturer: Pankaj K. Agarwal Scribe: Qiuhua Liu 19.1 The Building Blocks of Protein [1] Proteins

### Web Data Extraction: 1 o Semestre 2007/2008

Web Data : Given Slides baseados nos slides oficiais do livro Web Data Mining c Bing Liu, Springer, December, 2006. Departamento de Engenharia Informática Instituto Superior Técnico 1 o Semestre 2007/2008

### Data for phylogenetic analysis

Data for phylogenetic analysis The data that are used to estimate the phylogeny of a set of tips are the characteristics of those tips. Therefore the success of phylogenetic inference depends in large

### EMBOSS A data analysis package

EMBOSS A data analysis package Adapted from course developed by Lisa Mullin (EMBL-EBI) and David Judge Cambridge University EMBOSS is a free Open Source software analysis package specially developed for

### Design Style of BLAST and FASTA and Their Importance in Human Genome.

Design Style of BLAST and FASTA and Their Importance in Human Genome. Saba Khalid 1 and Najam-ul-haq 2 SZABIST Karachi, Pakistan Abstract: This subjected study will discuss the concept of BLAST and FASTA.BLAST

### 2. The Law of Independent Assortment Members of one pair of genes (alleles) segregate independently of members of other pairs.

1. The Law of Segregation: Genes exist in pairs and alleles segregate from each other during gamete formation, into equal numbers of gametes. Progeny obtain one determinant from each parent. 2. The Law

### Module 10: Bioinformatics

Module 10: Bioinformatics 1.) Goal: To understand the general approaches for basic in silico (computer) analysis of DNA- and protein sequences. We are going to discuss sequence formatting required prior

### Usability in bioinformatics mobile applications

Usability in bioinformatics mobile applications what we are working on Noura Chelbah, Sergio Díaz, Óscar Torreño, and myself Juan Falgueras App name Performs Advantajes Dissatvantajes Link The problem

### 2.3 Identify rrna sequences in DNA

2.3 Identify rrna sequences in DNA For identifying rrna sequences in DNA we will use rnammer, a program that implements an algorithm designed to find rrna sequences in DNA [5]. The program was made by

### Graph theoretic approach to analyze amino acid network

Int. J. Adv. Appl. Math. and Mech. 2(3) (2015) 31-37 (ISSN: 2347-2529) Journal homepage: www.ijaamm.com International Journal of Advances in Applied Mathematics and Mechanics Graph theoretic approach to

### HIV NOMOGRAM USING BIG DATA ANALYTICS

HIV NOMOGRAM USING BIG DATA ANALYTICS S.Avudaiselvi and P.Tamizhchelvi Student Of Ayya Nadar Janaki Ammal College (Sivakasi) Head Of The Department Of Computer Science, Ayya Nadar Janaki Ammal College

### Core Bioinformatics. Degree Type Year Semester. 4313473 Bioinformàtica/Bioinformatics OB 0 1

Core Bioinformatics 2014/2015 Code: 42397 ECTS Credits: 12 Degree Type Year Semester 4313473 Bioinformàtica/Bioinformatics OB 0 1 Contact Name: Sònia Casillas Viladerrams Email: Sonia.Casillas@uab.cat

### Just the Facts: A Basic Introduction to the Science Underlying NCBI Resources

1 of 8 11/7/2004 11:00 AM National Center for Biotechnology Information About NCBI NCBI at a Glance A Science Primer Human Genome Resources Model Organisms Guide Outreach and Education Databases and Tools

### CUDA-Enabled Applications for Nextgeneration. Bertil Schmidt

CUDA-Enabled Applications for Nextgeneration Sequencing Bertil Schmidt Next-Generation Sequencing (NGS) DNA Read-sequences May contain errors! DNA-sequence 1x drop from -1 Illumina HiSeq Read length (typical)

### Section 3 Comparative Genomics and Phylogenetics

Section 3 Section 3 Comparative enomics and Phylogenetics At the end of this section you should be able to: Describe what is meant by DNA sequencing. Explain what is meant by Bioinformatics and Comparative

### Gold (Genetic Optimization for Ligand Docking) G. Jones et al. 1996

Gold (Genetic Optimization for Ligand Docking) G. Jones et al. 1996 LMU Institut für Informatik, LFE Bioinformatik, Cheminformatics, Structure based methods J. Apostolakis 1 Genetic algorithms Inspired

### Score, Bit-score, P-value, E-value

Score, Bit-score, P-value, E-value Score: A number used to assess the biological relevance of a finding. In the context of sequence alignments, a score is a numerical value that describes the overall quality

### MATCH Commun. Math. Comput. Chem. 61 (2009) 781-788

MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 61 (2009) 781-788 ISSN 0340-6253 Three distances for rapid similarity analysis of DNA sequences Wei Chen,

### Efficient Parallel Execution of Sequence Similarity Analysis Via Dynamic Load Balancing

Efficient Parallel Execution of Sequence Similarity Analysis Via Dynamic Load Balancing James D. Jackson Philip J. Hatcher Department of Computer Science Kingsbury Hall University of New Hampshire Durham,

### Hidden Markov Models in Bioinformatics. By Máthé Zoltán Kőrösi Zoltán 2006

Hidden Markov Models in Bioinformatics By Máthé Zoltán Kőrösi Zoltán 2006 Outline Markov Chain HMM (Hidden Markov Model) Hidden Markov Models in Bioinformatics Gene Finding Gene Finding Model Viterbi algorithm

### Final Project Report

CPSC545 by Introduction to Data Mining Prof. Martin Schultz & Prof. Mark Gerstein Student Name: Yu Kor Hugo Lam Student ID : 904907866 Due Date : May 7, 2007 Introduction Final Project Report Pseudogenes

### AP BIOLOGY 2010 SCORING GUIDELINES (Form B)

AP BIOLOGY 2010 SCORING GUIDELINES (Form B) Question 2 Certain human genetic conditions, such as sickle cell anemia, result from single base-pair mutations in DNA. (a) Explain how a single base-pair mutation

### DNA Replication & Protein Synthesis. This isn t a baaaaaaaddd chapter!!!

DNA Replication & Protein Synthesis This isn t a baaaaaaaddd chapter!!! The Discovery of DNA s Structure Watson and Crick s discovery of DNA s structure was based on almost fifty years of research by other

### On Covert Data Communication Channels Employing DNA Steganography with Application in Massive Data Storage

ARAB ACADEMY FOR SCIENCE, TECHNOLOGY AND MARITIME TRANSPORT COLLEGE OF ENGINEERING AND TECHNOLOGY COMPUTER ENGINEERING DEPARTMENT On Covert Data Communication Channels Employing DNA Steganography with

### How Populations Evolve

How Populations Evolve Darwin and the Origin of the Species Charles Darwin published On the Origin of Species by Means of Natural Selection, November 24, 1859. Darwin presented two main concepts: Life

### THE PROTEIN METRIC SPACE: A STUDY IN CLUSTERING. Thesis submitted for the degree of. Doctor of Philosophy. Ori Sasson

THE PROTEIN METRIC SPACE: A STUDY IN CLUSTERING Thesis submitted for the degree of Doctor of Philosophy by Ori Sasson Submitted to the Senate of the Hebrew University December 2005 This work was carried

### Gene mutation and molecular medicine Chapter 15

Gene mutation and molecular medicine Chapter 15 Lecture Objectives What Are Mutations? How Are DNA Molecules and Mutations Analyzed? How Do Defective Proteins Lead to Diseases? What DNA Changes Lead to

### Analysis of two genes from the X and Y chromosomes of plant species from the genus Silene

Analysis of DNA sequence data p. 1 Analysis of DNA sequence data using MEGA and DNAsp. Analysis of two genes from the X and Y chromosomes of plant species from the genus Silene The first two computer classes

### Current Motif Discovery Tools and their Limitations

Current Motif Discovery Tools and their Limitations Philipp Bucher SIB / CIG Workshop 3 October 2006 Trendy Concepts and Hypotheses Transcription regulatory elements act in a context-dependent manner.

### Ch. 13 How Populations Evolve Period. 4. Describe Lamarck s proposed theory of evolution, The Theory of Acquired Traits.

Ch. 13 How Populations Evolve Name Period California State Standards covered by this chapter: Evolution 7. The frequency of an allele in a gene pool of a population depends on many factors and may be stable

### Sequence Formats and Sequence Database Searches. Gloria Rendon SC11 Education June, 2011

Sequence Formats and Sequence Database Searches Gloria Rendon SC11 Education June, 2011 Sequence A is the primary structure of a biological molecule. It is a chain of residues that form a precise linear

### Heuristics for the Sorting by Length-Weighted Inversions Problem on Signed Permutations

Heuristics for the Sorting by Length-Weighted Inversions Problem on Signed Permutations AlCoB 2014 First International Conference on Algorithms for Computational Biology Thiago da Silva Arruda Institute

### Interaktionen von RNAs und Proteinen

Sonja Prohaska Computational EvoDevo Universitaet Leipzig June 9, 2015 Studying RNA-protein interactions Given: target protein known to bind to RNA problem: find binding partners and binding sites experimental

### Flexible Information Visualization of Multivariate Data from Biological Sequence Similarity Searches

Flexible Information Visualization of Multivariate Data from Biological Sequence Similarity Searches Ed Huai-hsin Chi y, John Riedl y, Elizabeth Shoop y, John V. Carlis y, Ernest Retzel z, Phillip Barry

### SeqScape Software Version 2.5 Comprehensive Analysis Solution for Resequencing Applications

Product Bulletin Sequencing Software SeqScape Software Version 2.5 Comprehensive Analysis Solution for Resequencing Applications Comprehensive reference sequence handling Helps interpret the role of each

### Data Integration via Constrained Clustering: An Application to Enzyme Clustering

Data Integration via Constrained Clustering: An Application to Enzyme Clustering Elisa Boari de Lima Raquel Cardoso de Melo Minardi Wagner Meira Jr. Mohammed Javeed Zaki Abstract When multiple data sources

### Mr G Baktavatchalam Student, ME Software Engineering PSG College of Technology 919790234621 gmbakthavatchalam@gmail.com ABSTRACT

A Novel Approach to Multiple Sequence Alignment using Hadoop Data Grids Dr G Sudha Sadasivam Professor, CSE Department PSG College of Technology 91422222146 sudhasadhasivam@yahoo.com Mr G Baktavatchalam

### Lecture 3: Mutations

Lecture 3: Mutations Recall that the flow of information within a cell involves the transcription of DNA to mrna and the translation of mrna to protein. Recall also, that the flow of information between

### From DNA to Protein. Proteins. Chapter 13. Prokaryotes and Eukaryotes. The Path From Genes to Proteins. All proteins consist of polypeptide chains

Proteins From DNA to Protein Chapter 13 All proteins consist of polypeptide chains A linear sequence of amino acids Each chain corresponds to the nucleotide base sequence of a gene The Path From Genes

### 1 Mutation and Genetic Change

CHAPTER 14 1 Mutation and Genetic Change SECTION Genes in Action KEY IDEAS As you read this section, keep these questions in mind: What is the origin of genetic differences among organisms? What kinds

### Sequence Analysis Instructions

Sequence Analysis Instructions In order to predict your drug metabolizing phenotype from your CYP2D6 gene sequence, you must determine: 1) The assembled sequence from your two opposing sequencing reactions

### PHYML Online: A Web Server for Fast Maximum Likelihood-Based Phylogenetic Inference

PHYML Online: A Web Server for Fast Maximum Likelihood-Based Phylogenetic Inference Stephane Guindon, F. Le Thiec, Patrice Duroux, Olivier Gascuel To cite this version: Stephane Guindon, F. Le Thiec, Patrice

### Biology & Big Data. Debasis Mitra Professor, Computer Science, FIT

Biology & Big Data Debasis Mitra Professor, Computer Science, FIT Cloud? Debasis Mitra, Florida Tech Data as Service Transparent to user Multiple locations Robustness Software as Service Software location

### MORPHEUS. http://biodev.cea.fr/morpheus/ Prediction of Transcription Factors Binding Sites based on Position Weight Matrix.

MORPHEUS http://biodev.cea.fr/morpheus/ Prediction of Transcription Factors Binding Sites based on Position Weight Matrix. Reference: MORPHEUS, a Webtool for Transcripton Factor Binding Analysis Using

### Genetic Algorithms and Sudoku

Genetic Algorithms and Sudoku Dr. John M. Weiss Department of Mathematics and Computer Science South Dakota School of Mines and Technology (SDSM&T) Rapid City, SD 57701-3995 john.weiss@sdsmt.edu MICS 2009