Supplementary Table 1. Data collection and refinement statistics
|
|
|
- Christine Patterson
- 5 years ago
- Views:
Transcription
1 Supplementary Table 1. Data collection and refinement statistics APY-EphA4 APY-βAla8.am-EphA4 Crystal Space group P2 1 P2 1 Cell dimensions a, b, c (Å) 36.27, 127.7, , 127.2, 84.6 α, β, γ ( ) 90, 90, 90 90, 90, 90 Data processing statistics Resolution (Å) ( ) ( ) R merge (0.219) (0.207) Reflections (18172) (27979) Unique reflections (2882) 9181 (27766) I/σI 14.4 (4.9) 13.1 (4.8) CC1/ (0.971) (0.935) Completeness (%) 93.4 (90.1) 92.3 (80.6) Redundancy 6.6 (6.3) 3.6 (3.3) Model Peptide-EphA4 complexes per asymmetric unit 4 4 No. atoms Peptide/EphA4 388/ /5670 Water Other solvent Refinement statistics Resolution (Å) ( ) ( ) Reflections (1860) (1778) R work /R free / (0.301/0.423) / (0.199/0.252) R.m.s deviations Bond lengths (Å) Bond angles ( ) Ramachandran* favored (%) allowed (%) MolProbity Score/Percentile* 2.25/84th 1.86/96th *The βala residue was omitted from the analysis.
2 Supplementary Table 2. Phage display libraries Name APY peptide Library 1 Library 2 Library 3 Library 4 Sequence APYCVYRGSWSC APXCVXRGSWSC APYCXYXGXXXC F F W L C Q APYCVYXGXWXC XXXCVYRGSWSC
3 Supplementary Table 3. Sequences from non-panned phage clones # of clones Peptide sequence DNA sequence EphA4 binding library 1 APXCVXRGSWSC GCT CCG NNK TGT GTG NNK AGG GGT TCT TGG TCG TGT* 1 APYCVWRGSWSC GCT CCG TAT TGT GTG TGG AGG GGT TCT TGG TCG TGT + 1 APACVLRGSWSC GCT CCG GCG TGT GTG TTG AGG GGT TCT TGG TCG TGT - 1 APACVVRGSWSS GCT CCG GCG TGT GTG GTG AGG GGT TCT TGG TCG TCT - 1 APCCVERGSWSS GCT CCG TGT TGT GTG GAG AGG GGT TCT TGG TCG TCT - 1 APCCVGRGSWSC GCT CCG TGT TGT GTG GGT AGG GGT TCT TGG TCG TGT - 1 APDCVQRGSWSC** GCT CCG GAT TGT GTG TAG AGG GGT TCT TGG TCG TGT - 1 APDCVVRGSWSC GCT CCG GAT TGT GTG GTG AGG GGT TCT TGG TCG TGT - 1 APECVARGSWSC GCT CCG GAG TGT GTG GCT AGG GGT TCT TGG TCG TGT - 1 APGCVDRGSWSC GCT CCG GGT TGT GTG GAT AGG GGT TCT TGG TCG TGT - 1 APGCVVRGSWSC GCT CCG GGG TGT GTG GTT AGG GGT TCT TGG TCG TGT - 1 APICVMRGSWSS GCT CCG ATT TGT GTG ATG AGG GGT TCT TGG TCG TCT - 1 APICVTRGSWSC GCT CCG ATT TGT GTG ACT AGG GGT TCT TGG TCG TGT - 1 APKCVDRGSWSS GCT CCG AAG TGT GTG GAT AGG GGT TCT TGG TCG TCT - 1 APLCVERGSWSC GCT CCG CTT TGT GTG GAG AGG GGT TCT TGG TCG TGT - 1 APLCVPRGSWSC GCT CCG CTG TGT GTG CCT AGG GGT TCT TGG TCG TGT - 1 APLCVSRGSWSS GCT CCG CTT TGT GTG TCG AGG GGT TCT TGG TCG TCT - 1 APMCVNRGSWSC GCT CCG ATG TGT GTG AAT AGG GGT TCT TGG TCG TGT - 1 APNCVGRGSWSC GCT CCG AAT TGT GTG GGT AGG GGT TCT TGG TCG TGT - 1 APNCVMRGSWSS GCT CCG AAT TGT GTG ATG AGG GGT TCT TGG TCG TCT - 1 APPCVLRGSWSC GCT CCG CCG TGT GTG CTT AGG GGT TCT TGG TCG TGT - 1 APPCVSRGSWSC GCT CCG CCT TGT GTG TCT AGG GGT TCT TGG TCG TGT - 1 APSCVDRGSWSC GCT CCG TCG TGT GTG GAT AGG GGT TCT TGG TCG TGT - 1 APSCVPRGSWSC GCT CCG AGT TGT GTG CCT AGG GGT TCT TGG TCG TGT - 1 APTCVSRGSWSC GCT CCG ACG TGT GTG TCG AGG GGT TCT TGG TCG TGT - 1 APTCVTRGSWSC GCT CCG ACT TGT GTG ACT AGG GGT TCT TGG TCG TGT - 1 APVCVQRGSWSC GCT CCG GTG TGT GTG CAG AGG GGT TCT TGG TCG TGT - 1 APVCVSRGSWSC GCT CCG GTT TGT GTG AGT AGG GGT TCT TGG TCG TGT - 1 APWCVIRGSWSC GCT CCG TGG TGT GTG ATT AGG GGT TCT TGG TCG TGT - 1 APWCVQRGSWSC GCT CCG TGG TGT GTG CAG AGG GGT TCT TGG TCG TGT - 1 APYCVPRGSWSC GCT CCG TAT TGT GTG CCT AGG GGT TCT TGG TCG TGT - 1 APYCVWRGSWSC GCT CCG TAT TGT GTG TGG AGG GGT TCT TGG TCG TGT + library 2 APYCXYXGXXXC GCT CCG TWT TGT NNK TDK NNK GGT NNK NNK NNK TGT F F W L C Q 1 APFCAWPGPTPC GCT CCG TTT TGT GCG TGG CCG GGT CCT ACT CCT TGT - 1 APFCLYEGKALC GCT CCG TTT TGT CTT TAT GAG GGT AAG GCT CTT TGT - 1 APFCPFGGNVQC GCT CCG TTT TGT CCT TTT GGT GGT AAT GTT CAG TGT - 1 APFCPFKGDPLC GCT CCG TTT TGT CCG TTT AAG GGT GAT CCT CTT TGT - 1 APFCSWHGAQRC GCT CCG TTT TGT TCG TGG CAT GGT GCT CAG AGG TGT - 1 APFCSYMGTPLC GCT CCG TTT TGT TCT TAT ATG GGT ACG CCT TTG TGT - 1 APFCSYRGHHPC GCT CCG TTT TGT TCT TAT CGT GGT CAT CAT CCT TGT - 1 APFCTYQGHLDC GCT CCG TTT TGT ACT TAT TAG GGT CAT CTT GAT TGT -
4 1 APYCAWAGKVRC GCT CCG TAT TGT GCT TGG GCT GGT AAG GTT AGG TGT - 1 APYCKFAGDTSC GCT CCG TAT TGT AAG TTT GCG GGT GAT ACT TCT TGT - 1 APYCKLNGHKNC GCT CCG TAT TGT AAG TTG AAT GGT CAT AAG AAT TGT - 1 APYCPQTGKYSC GCT CCG TAT TGT CCT TAG ACT GGT AAG TAT TCT TGT - 1 APYCPYNGPVRC GCT CCG TAT TGT CCG TAT AAT GGT CCG GTG CGT TGT - 1 APYCQLAGNIPC GCT CCG TAT TGT CAG TTG GCT GGT AAT ATT CCG TGT - 1 APYCSFSGHDKC GCT CCG TAT TGT AGT TTT AGT GGT CAT GAT AAG TGT - 1 APYCSLQGHYLC GCT CCG TAT TGT TCT TTG CAG GGT CAT TAT CTT TGT - 1 APYCSYNGPHTC GCT CCG TAT TGT TCT TAT AAT GGT CCT CAT ACT TGT - 1 APYCTQKGLNSC GCT CCG TAT TGT ACT TAG AAG GGT CTT AAT AGT TGT - 1 APYCTWHGTRNC GCT CCG TAT TGT ACT TGG CAT GGT ACT CGT AAT TGT - 1 APYCYLAGASPC GCT CCG TAT TGT TAT TTG GCG GGT GCT TCG CCT TGT - 1 APYCYWNGAYTC GCT CCG TAT TGT TAT TGG AAT GGT GCT TAT ACT TGT - library 3 APYCVYXGXWXC GCT CCG TAT TGT GTG TAT NNK GGT NNK TGG NNK TGT 1 APYCVYAGKWSC GCT CCG TAT TGT GTG TAT GCT GGT AAG TGG TCG TGT + 1 APYCVYEGLWNC GCT CCG TAT TGT GTG TAT GAG GGT CTG TGG AAT TGT + 1 APYCVYGGLWTC GCT CCG TAT TGT GTG TAT GGG GGT TTG TGG ACG TGT + 2 APYCVYKGSWNC GCT CCG TAT TGT GTG TAT AAG GGT TCG TGG AAT TGT + 1 APYCVYQGLWEC GCT CCG TAT TGT GTG TAT CAG GGT TTG TGG GAG TGT + 1 APYCVYRGHWGC GCT CCG TAT TGT GTG TAT CGG GGT CAT TGG GGG TGT + 1 APYCVYAGHWPC GCT CCG TAT TGT GTG TAT GCG GGT CAT TGG CCG TGT - 1 APYCVYHGPWGC GCT CCG TAT TGT GTG TAT CAT GGT CCT TGG GGT TGT - 1 APYCVYPGDWAC GCT CCG TAT TGT GTG TAT CCG GGT GAT TGG GCT TGT - 1 APYCVYPGHWQC GCT CCG TAT TGT GTG TAT CCT GGT CAT TGG CAG TGT - 1 APYCVYQGAWGC GCT CCG TAT TGT GTG TAT CAG GGT GCT TGG GGT TGT - 1 APYCVYQGPWRC GCT CCG TAT TGT GTG TAT CAG GGT CCG TGG CGT TGT - 1 APYCVYTGAWPC GCT CCG TAT TGT GTG TAT ACT GGT GCT TGG CCG TGT - 1 APYCVYVGGWPC GCT CCG TAT TGT GTG TAT GTG GGT GGT TGG CCT TGT - library 4 XXXCVYRGSWSC NNK NNK NNK TGT GTG TAT AGG GGT TCT TGG TCG TGT 1 ALSCVYRGSWSC GCT CTG TCT TGT GTG TAT AGG GGT TCT TGG TCG TGT - 1 AVACVYRGSWSC GCG GTG GCG TGT GTG TAT AGG GGT TCT TGG TCG TGT - 1 FPPCVYRGSWSC TTT CCT CCT TGT GTG TAT AGG GGT TCT TGG TCG TGT - 1 GDWCVYRGSWSC GGT GAT TGG TGT GTG TAT AGG GGT TCT TGG TCG TGT - 1 GNECVYRGSWSC GGT AAT GAG TGT GTG TAT AGG GGT TCT TGG TCG TGT - 1 GYTCVYRGSWSC GGG TAT ACG TGT GTG TAT AGG GGT TCT TGG TCG TGT - 1 HQACVYRGSWSC CAT CAG GCT TGT GTG TAT AGG GGT TCT TGG TCG TGT -/+ 1 LCACVYRGSWSC TTG TGT GCT TGT GTG TAT AGG GGT TCT TGG TCG TGT - 1 LENCVYRGSWSC CTG GAG AAT TGT GTG TAT AGG GGT TCT TGG TCG TGT - 1 LLSCVYRGSWSC TTG TTG AGC TGT GTG TAT AGG GGT TCT TGG TCG TGT - 1 MSECVYRGSWSC ATG TCG GAG TGT GTG TAT AGG GGT TCT TGG TCG TGT - 1 MVNCVYRGSWSC ATG GTG AAT TGT GTG TAT AGG GGT TCT TGG TCG TGT - 2 NNHCVYRGSWSC AAT AAT CAT TGT GTG TAT AGG GGT TCT TGG TCG TGT - 1 VDSCVYRGSWSC GTG GAT TCT TGT GTG TAT AGG GGT TCT TGG TCG TGT - *M = A/C; K = G/T; W = A/T; D = A/G/T; N = A/C/G/T **TAG = Q
5
6
7 Supplementary Figure 3
8
HP22.1 Roth Random Primer Kit A für die RAPD-PCR
HP22.1 Roth Random Kit A für die RAPD-PCR Kit besteht aus 20 Einzelprimern, jeweils aufgeteilt auf 2 Reaktionsgefäße zu je 1,0 OD Achtung: Angaben beziehen sich jeweils auf ein Reaktionsgefäß! Sequenz
Genome Reconstruction: A Puzzle with a Billion Pieces Phillip E. C. Compeau and Pavel A. Pevzner
Genome Reconstruction: A Puzzle with a Billion Pieces Phillip E. C. Compeau and Pavel A. Pevzner Outline I. Problem II. Two Historical Detours III.Example IV.The Mathematics of DNA Sequencing V.Complications
by the Genevestigator program (www.genevestigator.com). Darker blue color indicates higher gene expression.
Figure S1. Tissue-specific expression profile of the genes that were screened through the RHEPatmatch and root-specific microarray filters. The gene expression profile (heat map) was drawn by the Genevestigator
Pyramidal and Chiral Groupings of Gold Nanocrystals Assembled Using DNA Scaffolds
Pyramidal and Chiral Groupings of Gold Nanocrystals Assembled Using DNA Scaffolds February 27, 2009 Alexander Mastroianni, Shelley Claridge, A. Paul Alivisatos Department of Chemistry, University of California,
Appendix A. Example code output. Chapter 1. Chapter 3
Appendix A Example code output This is a compilation of output from selected examples. Some of these examples requires exernal input from e.g. STDIN, for such examples the interaction with the program
6 Anhang. 6.1 Transgene Su(var)3-9-Linien. P{GS.ry + hs(su(var)3-9)egfp} 1 I,II,III,IV 3 2I 3 3 I,II,III 3 4 I,II,III 2 5 I,II,III,IV 3
6.1 Transgene Su(var)3-9-n P{GS.ry + hs(su(var)3-9)egfp} 1 I,II,III,IV 3 2I 3 3 I,II,III 3 4 I,II,II 5 I,II,III,IV 3 6 7 I,II,II 8 I,II,II 10 I,II 3 P{GS.ry + UAS(Su(var)3-9)EGFP} A AII 3 B P{GS.ry + (10.5kbSu(var)3-9EGFP)}
Genome Reconstruction: A Puzzle with a Billion Pieces. Phillip Compeau Carnegie Mellon University Computational Biology Department
http://cbd.cmu.edu Genome Reconstruction: A Puzzle with a Billion Pieces Phillip Compeau Carnegie Mellon University Computational Biology Department Eternity II: The Highest-Stakes Puzzle in History Courtesy:
SUPPLEMENTARY INFORMATION. Systematic evaluation of CRISPR-Cas systems reveals design principles for genome editing in human cells
SUPPLEMENTARY INFORMATION Systematic evaluation of CRISPR-Cas systems reveals design principles for genome editing in human cells Yuanming Wang 1,2,7, Kaiwen Ivy Liu 2,7, Norfala-Aliah Binte Sutrisnoh
TCGR: A Novel DNA/RNA Visualization Technique
TCGR: A Novel DNA/RNA Visualization Technique Donya Quick and Margaret H. Dunham Department of Computer Science and Engineering Southern Methodist University Dallas, Texas 75275 dquick@mail.smu.edu, mhd@engr.smu.edu
warm-up exercise Representing Data Digitally goals for today proteins example from nature
Representing Data Digitally Anne Condon September 6, 007 warm-up exercise pick two examples of in your everyday life* in what media are the is represented? is the converted from one representation to another,
Machine Learning Classifiers
Machine Learning Classifiers Outline Different types of learning problems Different types of learning algorithms Supervised learning Decision trees Naïve Bayes Perceptrons, Multi-layer Neural Networks
Digging into acceptor splice site prediction: an iterative feature selection approach
Digging into acceptor splice site prediction: an iterative feature selection approach Yvan Saeys, Sven Degroeve, and Yves Van de Peer Department of Plant Systems Biology, Ghent University, Flanders Interuniversity
Crick s Hypothesis Revisited: The Existence of a Universal Coding Frame
Crick s Hypothesis Revisited: The Existence of a Universal Coding Frame Jean-Louis Lassez*, Ryan A. Rossi Computer Science Department, Coastal Carolina University jlassez@coastal.edu, raross@coastal.edu
MLiB - Mandatory Project 2. Gene finding using HMMs
MLiB - Mandatory Project 2 Gene finding using HMMs Viterbi decoding >NC_002737.1 Streptococcus pyogenes M1 GAS TTGTTGATATTCTGTTTTTTCTTTTTTAGTTTTCCACATGAAAAATAGTTGAAAACAATA GCGGTGTCCCCTTAAAATGGCTTTTCCACAGGTTGTGGAGAACCCAAATTAACAGTGTTA
LABORATORY STANDARD OPERATING PROCEDURE FOR PULSENET CODE: PNL28 MLVA OF SHIGA TOXIN-PRODUCING ESCHERICHIA COLI
1. PURPOSE: to describe the standardized laboratory protocol for molecular subtyping of Shiga toxin-producing Escherichia coli O157 (STEC O157) and Salmonella enterica serotypes Typhimurium and Enteritidis.
Supplementary Materials:
Supplementary Materials: Amino acid codo n Numb er Table S1. Codon usage in all the protein coding genes. RSC U Proportion (%) Amino acid codo n Numb er RSC U Proportion (%) Phe UUU 861 1.31 5.71 Ser UCU
Supplementary Data. Image Processing Workflow Diagram A - Preprocessing. B - Hough Transform. C - Angle Histogram (Rose Plot)
Supplementary Data Image Processing Workflow Diagram A - Preprocessing B - Hough Transform C - Angle Histogram (Rose Plot) D - Determination of holes Description of Image Processing Workflow The key steps
A relation between trinucleotide comma-free codes and trinucleotide circular codes
Theoretical Computer Science 401 (2008) 17 26 www.elsevier.com/locate/tcs A relation between trinucleotide comma-free codes and trinucleotide circular codes Christian J. Michel a,, Giuseppe Pirillo b,c,
2 41L Tag- AA GAA AAA ATA AAA GCA TTA RYA GAA ATT TGT RMW GAR C K65 Tag- A AAT CCA TAC AAT ACT CCA GTA TTT GCY ATA AAG AA
176 SUPPLEMENTAL TABLES 177 Table S1. ASPE Primers for HIV-1 group M subtype B Primer no Type a Sequence (5'-3') Tag ID b Position c 1 M41 Tag- AA GAA AAA ATA AAA GCA TTA RYA GAA ATT TGT RMW GAR A d 45
Supporting Information
Copyright WILEY VCH Verlag GmbH & Co. KGaA, 69469 Weinheim, Germany, 2015. Supporting Information for Small, DOI: 10.1002/smll.201501370 A Compact DNA Cube with Side Length 10 nm Max B. Scheible, Luvena
Degenerate Coding and Sequence Compacting
ESI The Erwin Schrödinger International Boltzmanngasse 9 Institute for Mathematical Physics A-1090 Wien, Austria Degenerate Coding and Sequence Compacting Maya Gorel Kirzhner V.M. Vienna, Preprint ESI
Sequence Assembly. BMI/CS 576 Mark Craven Some sequencing successes
Sequence Assembly BMI/CS 576 www.biostat.wisc.edu/bmi576/ Mark Craven craven@biostat.wisc.edu Some sequencing successes Yersinia pestis Cannabis sativa The sequencing problem We want to determine the identity
Efficient Selection of Unique and Popular Oligos for Large EST Databases. Stefano Lonardi. University of California, Riverside
Efficient Selection of Unique and Popular Oligos for Large EST Databases Stefano Lonardi University of California, Riverside joint work with Jie Zheng, Timothy Close, Tao Jiang University of California,
CSCI2950-C Lecture 4 DNA Sequencing and Fragment Assembly
CSCI2950-C Lecture 4 DNA Sequencing and Fragment Assembly Ben Raphael Sept. 22, 2009 http://cs.brown.edu/courses/csci2950-c/ l-mer composition Def: Given string s, the Spectrum ( s, l ) is unordered multiset
Graph 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
Sequencing. 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
DNA Sequencing The Shortest Superstring & Traveling Salesman Problems Sequencing by Hybridization
Eulerian & Hamiltonian Cycle Problems DNA Sequencing The Shortest Superstring & Traveling Salesman Problems Sequencing by Hybridization The Bridge Obsession Problem Find a tour crossing every bridge just
DNA Sequencing. Overview
BINF 3350, Genomics and Bioinformatics DNA Sequencing Young-Rae Cho Associate Professor Department of Computer Science Baylor University Overview Backgrounds Eulerian Cycles Problem Hamiltonian Cycles
OFFICE OF RESEARCH AND SPONSORED PROGRAMS
OFFICE OF RESEARCH AND SPONSORED PROGRAMS June 9, 2016 Mr. Satoshi Harada Department of Innovation Research Japan Science and Technology Agency (JST) K s Gobancho, 7, Gobancho, Chiyoda-ku, Tokyo, 102-0076
3. The object system(s)
3. The object system(s) Thomas Lumley Ken Rice Universities of Washington and Auckland Seattle, June 2011 Generics and methods Many functions in R are generic. This means that the function itself (eg plot,
10/15/2009 Comp 590/Comp Fall
Lecture 13: Graph Algorithms Study Chapter 8.1 8.8 10/15/2009 Comp 590/Comp 790-90 Fall 2009 1 The Bridge Obsession Problem Find a tour crossing every bridge just once Leonhard Euler, 1735 Bridges of Königsberg
QuasiAlign: Position Sensitive P-Mer Frequency Clustering with Applications to Genomic Classification and Differentiation
QuasiAlign: Position Sensitive P-Mer Frequency Clustering with Applications to Genomic Classification and Differentiation Anurag Nagar Southern Methodist University Michael Hahsler Southern Methodist University
Problem statement. CS267 Assignment 3: Parallelize Graph Algorithms for de Novo Genome Assembly. Spring Example.
CS267 Assignment 3: Problem statement 2 Parallelize Graph Algorithms for de Novo Genome Assembly k-mers are sequences of length k (alphabet is A/C/G/T). An extension is a simple symbol (A/C/G/T/F). The
Purpose of sequence assembly
Sequence Assembly Purpose of sequence assembly Reconstruct long DNA/RNA sequences from short sequence reads Genome sequencing RNA sequencing for gene discovery Amplicon sequencing But not for transcript
Algorithms for Bioinformatics
Adapted from slides by Alexandru Tomescu, Leena Salmela and Veli Mäkinen, which are partly from http://bix.ucsd.edu/bioalgorithms/slides.php 58670 Algorithms for Bioinformatics Lecture 5: Graph Algorithms
10/8/13 Comp 555 Fall
10/8/13 Comp 555 Fall 2013 1 Find a tour crossing every bridge just once Leonhard Euler, 1735 Bridges of Königsberg 10/8/13 Comp 555 Fall 2013 2 Find a cycle that visits every edge exactly once Linear
Structural analysis and haplotype diversity in swine LEP and MC4R genes
J. Anim. Breed. Genet. ISSN - OIGINAL ATICLE Structural analysis and haplotype diversity in swine LEP and MC genes M. D Andrea, F. Pilla, E. Giuffra, D. Waddington & A.L. Archibald University of Molise,
1. PURPOSE: to describe the standardized laboratory protocol for molecular subtyping of Salmonella enterica serotype Enteritidis.
1. PURPOSE: to describe the standardized laboratory protocol for molecular subtyping of Salmonella enterica serotype Enteritidis. 2. SCOPE: to provide the PulseNet participants with a single protocol for
Mining more complex patterns: frequent subsequences and subgraphs. Department of Computers, Czech Technical University in Prague
Mining more complex patterns: frequent subsequences and subgraphs Jiří Kléma Department of Computers, Czech Technical University in Prague http://cw.felk.cvut.cz/wiki/courses/a4m33sad/start poutline Motivation
Sequence 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
Computational Methods for de novo Assembly of Next-Generation Genome Sequencing Data
1/39 Computational Methods for de novo Assembly of Next-Generation Genome Sequencing Data Rayan Chikhi ENS Cachan Brittany / IRISA (Genscale team) Advisor : Dominique Lavenier 2/39 INTRODUCTION, YEAR 2000
de Bruijn graphs for sequencing data
de Bruijn graphs for sequencing data Rayan Chikhi CNRS Bonsai team, CRIStAL/INRIA, Univ. Lille 1 SMPGD 2016 1 MOTIVATION - de Bruijn graphs are instrumental for reference-free sequencing data analysis:
de novo assembly Rayan Chikhi Pennsylvania State University Workshop On Genomics - Cesky Krumlov - January /73
1/73 de novo assembly Rayan Chikhi Pennsylvania State University Workshop On Genomics - Cesky Krumlov - January 2014 2/73 YOUR INSTRUCTOR IS.. - Postdoc at Penn State, USA - PhD at INRIA / ENS Cachan,
DNA Fragment Assembly
Algorithms in Bioinformatics Sami Khuri Department of Computer Science San José State University San José, California, USA khuri@cs.sjsu.edu www.cs.sjsu.edu/faculty/khuri DNA Fragment Assembly Overlap
Genome 373: Genome Assembly. Doug Fowler
Genome 373: Genome Assembly Doug Fowler What are some of the things we ve seen we can do with HTS data? We ve seen that HTS can enable a wide variety of analyses ranging from ID ing variants to genome-
Scalable Solutions for DNA Sequence Analysis
Scalable Solutions for DNA Sequence Analysis Michael Schatz Dec 4, 2009 JHU/UMD Joint Sequencing Meeting The Evolution of DNA Sequencing Year Genome Technology Cost 2001 Venter et al. Sanger (ABI) $300,000,000
How to Run NCBI BLAST on zcluster at GACRC
How to Run NCBI BLAST on zcluster at GACRC BLAST: Basic Local Alignment Search Tool Georgia Advanced Computing Resource Center University of Georgia Suchitra Pakala pakala@uga.edu 1 OVERVIEW What is BLAST?
Graph Algorithms in Bioinformatics
Graph Algorithms in Bioinformatics Bioinformatics: Issues and Algorithms CSE 308-408 Fall 2007 Lecture 13 Lopresti Fall 2007 Lecture 13-1 - Outline Introduction to graph theory Eulerian & Hamiltonian Cycle
WSSP-10 Chapter 7 BLASTN: DNA vs DNA searches
WSSP-10 Chapter 7 BLASTN: DNA vs DNA searches 4-3 DSAP: BLASTn Page p. 7-1 NCBI BLAST Home Page p. 7-1 NCBI BLASTN search page p. 7-2 Copy sequence from DSAP or wave form program p. 7-2 Choose a database
Index-assisted approximate matching
Index-assisted approximate matching Ben Langmead Department of Computer Science You are free to use these slides. If you do, please sign the guestbook (www.langmead-lab.org/teaching-materials), or email
Supplementary Information
Supplementary Information Supplementary Figure S1 The scheme of MtbHadAB/MtbHadBC dehydration reaction. The reaction is reversible. However, in the context of FAS-II elongation cycle, this reaction tends
Algorithms for Bioinformatics
Adapted from slides by Alexandru Tomescu, Leena Salmela and Veli Mäkinen, which are partly from http://bix.ucsd.edu/bioalgorithms/slides.php 582670 Algorithms for Bioinformatics Lecture 3: Graph Algorithms
Supporting Information
Supprting Inrmatin Ultraspeciic Multiplexed Detectin Lw-Abundance Single-Nucletide Variants by Cmbining a Masking Tactic with Flurescent Nanparticle Cunting Xiajing Pei, Tiancheng Lai, Guangyu Ta, Hu Hng,
3. Open Vector NTI 9 (note 2) from desktop. A three pane window appears.
SOP: SP043.. Recombinant Plasmid Map Design Vector NTI Materials and Reagents: 1. Dell Dimension XPS T450 Room C210 2. Vector NTI 9 application, on desktop 3. Tuberculist database open in Internet Explorer
Read Mapping. de Novo Assembly. Genomics: Lecture #2 WS 2014/2015
Mapping de Novo Assembly Institut für Medizinische Genetik und Humangenetik Charité Universitätsmedizin Berlin Genomics: Lecture #2 WS 2014/2015 Today Genome assembly: the basics Hamiltonian and Eulerian
DELAMANID SUSCEPTIBILITY TESTING IN AN AUTOMATED LIQUID CULTURE SYSTEM
DELAMANID SUSCEPTIBILITY TESTING IN AN AUTOMATED LIQUID CULTURE SYSTEM Daniela Maria Cirillo San Raffaele Scientific Institute, Milan COI/CA OSR as signed MTA with Janssen and Otzuka as SRL and is involved
DNA Fragment Assembly Algorithms: Toward a Solution for Long Repeats
San Jose State University SJSU ScholarWorks Master's Projects Master's Theses and Graduate Research 2008 DNA Fragment Assembly Algorithms: Toward a Solution for Long Repeats Ching Li San Jose State University
de novo assembly Simon Rasmussen 36626: Next Generation Sequencing analysis DTU Bioinformatics Next Generation Sequencing Analysis
de novo assembly Simon Rasmussen 36626: Next Generation Sequencing analysis DTU Bioinformatics 27626 - Next Generation Sequencing Analysis Generalized NGS analysis Data size Application Assembly: Compare
A Novel Implementation of an Extended 8x8 Playfair Cipher Using Interweaving on DNA-encoded Data
International Journal of Electrical and Computer Engineering (IJECE) Vol. 4, No. 1, Feburary 2014, pp. 93~100 ISSN: 2088-8708 93 A Novel Implementation of an Extended 8x8 Playfair Cipher Using Interweaving
Assignment 2. Summary. Some Important bash Instructions. CSci132 Practical UNIX and Programming Assignment 2, Fall Prof.
Assignment 2 Summary The purpose of this assignment is to give you some practice in bash scripting. When you write a bash script, you are really writing a program in the bash programming language. In class
Eulerian Tours and Fleury s Algorithm
Eulerian Tours and Fleury s Algorithm CSE21 Winter 2017, Day 12 (B00), Day 8 (A00) February 8, 2017 http://vlsicad.ucsd.edu/courses/cse21-w17 Vocabulary Path (or walk): describes a route from one vertex
Structure-Reactivity Relationships of Zwitterionic 1,3-Diaza-Claisen Rearrangements. Supporting Information
Structure-Reactivity Relationships of Zwitterionic 1,3-Diaza-Claisen Rearrangements Rachel A. Potter, Amy Bowser, Yanbo Yang and José S. Madalengoitia, * Joseph W. Ziller * Department of Chemistry, University
Assembly in the Clouds
Assembly in the Clouds Michael Schatz October 13, 2010 Beyond the Genome Shredded Book Reconstruction Dickens accidentally shreds the first printing of A Tale of Two Cities Text printed on 5 long spools
Detecting Superbubbles in Assembly Graphs. Taku Onodera (U. Tokyo)! Kunihiko Sadakane (NII)! Tetsuo Shibuya (U. Tokyo)!
Detecting Superbubbles in Assembly Graphs Taku Onodera (U. Tokyo)! Kunihiko Sadakane (NII)! Tetsuo Shibuya (U. Tokyo)! de Bruijn Graph-based Assembly Reads (substrings of original DNA sequence) de Bruijn
Strings. Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas
Strings Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas Run a program by typing at a terminal prompt (which may be > or $ or something else depending on your computer;
Algorithms and Data Structures
Algorithms and Data Structures Sorting beyond Value Comparisons Marius Kloft Content of this Lecture Radix Exchange Sort Sorting bitstrings in linear time (almost) Bucket Sort Marius Kloft: Alg&DS, Summer
DNA Fragment Assembly
SIGCSE 009 Algorithms in Bioinformatics Sami Khuri Department of Computer Science San José State University San José, California, USA khuri@cs.sjsu.edu www.cs.sjsu.edu/faculty/khuri DNA Fragment Assembly
Table S1 Comparison of CypA observed Bragg data vs. calculated from Normal Modes.
Table S1 Comparison of CypA observed Bragg data vs. calculated from Normal Modes. Resolution (Å) R-factor CC 44.560-11.070 0.5713 0.4144 11.070-8.698 0.3325 0.6957 8.697-6.834 0.2987 0.7324 6.831-5.369
Eulerian tours. Russell Impagliazzo and Miles Jones Thanks to Janine Tiefenbruck. April 20, 2016
Eulerian tours Russell Impagliazzo and Miles Jones Thanks to Janine Tiefenbruck http://cseweb.ucsd.edu/classes/sp16/cse21-bd/ April 20, 2016 Seven Bridges of Konigsberg Is there a path that crosses each
Graphs and Puzzles. Eulerian and Hamiltonian Tours.
Graphs and Puzzles. Eulerian and Hamiltonian Tours. CSE21 Winter 2017, Day 11 (B00), Day 7 (A00) February 3, 2017 http://vlsicad.ucsd.edu/courses/cse21-w17 Exam Announcements Seating Chart on Website Good
Genome 373: Intro to Python I. Doug Fowler
Genome 373: Intro to Python I Doug Fowler Outline Intro to Python I What is a program? Dealing with data Strings in Python Numbers in Python What is a program? What is a program? A series of instruc2ons,
Parallel de novo Assembly of Complex (Meta) Genomes via HipMer
Parallel de novo Assembly of Complex (Meta) Genomes via HipMer Aydın Buluç Computational Research Division, LBNL May 23, 2016 Invited Talk at HiCOMB 2016 Outline and Acknowledgments Joint work (alphabetical)
Model-Building of Proteins Using X-ray Data With Coot. Paul Emsley May 2013
Model-Building of Proteins Using X-ray Data With Coot Paul Emsley May 2013 Which coot? Coot-0.7.1-pre revision 4600 (or so) Linux: http://www.ccp4.ac.uk/coot/nightlies/pre-release/ Mac OS X Windows Bill
B 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
Has my experiment worked?
Has my experiment worked? Santosh Panjikar SP :Auto-Rickshaw Experiment? SAD/MAD RIP MR SAD/MAD Anomalous signal can be measured from the crystal The original data are complete (>90%, better > ( 95% The
Multiple Sequence Alignment. With thanks to Eric Stone and Steffen Heber, North Carolina State University
Multiple Sequence Alignment With thanks to Eric Stone and Steffen Heber, North Carolina State University Definition: Multiple sequence alignment Given a set of sequences, a multiple sequence alignment
BCH 6744C: Macromolecular Structure Determination by X-ray Crystallography. Practical 5 Refinement and Structure Function Analysis
BCH 6744C: Macromolecular Structure Determination by X-ray Crystallography Practical 5 Refinement and Structure Function Analysis Introduction The ultimate goal of most structural analyses is to relate
A First Introduction to Scientific Visualization Geoffrey Gray
Visual Molecular Dynamics A First Introduction to Scientific Visualization Geoffrey Gray VMD on CIRCE: On the lower bottom left of your screen, click on the window start-up menu. In the search box type
de novo assembly & k-mers
de novo assembly & k-mers Rayan Chikhi CNRS Workshop on Genomics - Cesky Krumlov January 2018 1 YOUR INSTRUCTOR IS.. - Junior CNRS bioinformatics researcher in Lille, France - Postdoc: Penn State, USA;
I519 Introduction to Bioinformatics, Genome assembly. Yuzhen Ye School of Informatics & Computing, IUB
I519 Introduction to Bioinformatics, 2014 Genome assembly Yuzhen Ye (yye@indiana.edu) School of Informatics & Computing, IUB Contents Genome assembly problem Approaches Comparative assembly The string
A CAM(Content Addressable Memory)-based architecture for molecular sequence matching
A CAM(Content Addressable Memory)-based architecture for molecular sequence matching P.K. Lala 1 and J.P. Parkerson 2 1 Department Electrical Engineering, Texas A&M University, Texarkana, Texas, USA 2
Computational Architecture of Cloud Environments Michael Schatz. April 1, 2010 NHGRI Cloud Computing Workshop
Computational Architecture of Cloud Environments Michael Schatz April 1, 2010 NHGRI Cloud Computing Workshop Cloud Architecture Computation Input Output Nebulous question: Cloud computing = Utility computing
E cient Index Maintenance Under Dynamic Genome Modification
E cient Index Maintenance Under Dynamic Genome Modification Nitish Gupta úı,1 Komal Sanjeev ı,1, Tim Wall 2, Carl Kingsford 3, Rob Patro 1 1 Department of Computer Science, Stony Brook University, Stony
Dataflow Processing. A.R. Hurson Computer Science Department Missouri Science & Technology
A.R. Hurson Computer Science Department Missouri Science & Technology hurson@mst.edu 1 Control Flow Computation Operands are accessed by their addresses. Shared memory cells are the means by which data
debgr: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph Prashant Pandey Stony Brook University, NY, USA
debgr: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph Prashant Pandey Stony Brook University, NY, USA De Bruijn graphs are ubiquitous [Pevzner et al. 2001, Zerbino and Birney,
Solutions Exercise Set 3 Author: Charmi Panchal
Solutions Exercise Set 3 Author: Charmi Panchal Problem 1: Suppose we have following fragments: f1 = ATCCTTAACCCC f2 = TTAACTCA f3 = TTAATACTCCC f4 = ATCTTTC f5 = CACTCCCACACA f6 = CACAATCCTTAACCC f7 =
VESPA Manual Version 1.0β Andrew E. Webb, Thomas A. Walsh and Mary J. O Connell September,
VESPA Manual Version 1.0β Andrew E. Webb, Thomas A. Walsh and Mary J. O Connell September, 2015 www.mol-evol.org/vespa Table of Contents Table of Figures... 3 1.1: Introduction... 4 1.2: Phase and Pipeline
Pattern Matching. An Introduction to File Globs and Regular Expressions
Pattern Matching An Introduction to File Globs and Regular Expressions Copyright 2006 2009 Stewart Weiss The danger that lies ahead Much to your disadvantage, there are two different forms of patterns
Pattern Matching. An Introduction to File Globs and Regular Expressions. Adapted from Practical Unix and Programming Hunter College
Pattern Matching An Introduction to File Globs and Regular Expressions Adapted from Practical Unix and Programming Hunter College Copyright 2006 2009 Stewart Weiss The danger that lies ahead Much to your
BIOC351: Proteins. PyMOL Laboratory #2. Objects, Distances & Images
BIOC351: Proteins PyMOL Laboratory #2 Objects, Distances & Images Version 2.1 Valid commands in PyMOL are shown in green. Exercise A: Let s fetch 1fzc, a crystallographic dimer of a fragment of human fibrinogen
In Silico Modelling and Analysis of Ribosome Kinetics and aa-trna Competition
In Silico Modelling and Analysis of Ribosome Kinetics and aa-trna Competition D. Bošnački 1, T.E. Pronk 2, and E.P. de Vink 3, 1 Dept. of Biomedical Engineering, Eindhoven University of Technology 2 Swammerdam
Assignment 4. the three-dimensional positions of every single atom in the le,
Assignment 4 1 Overview and Background Many of the assignments in this course will introduce you to topics in computational biology. You do not need to know anything about biology to do these assignments
Supplemental Information
Supplemental Information Title: Generation of clonal zebrafish line by androgenesis without egg irradiation Jilun Hou a,, Takafumi Fujimoto b, *, Taiju Saito c, Etsuro Yamaha d, Katsutoshi Arai b 1 Supplemental
Memory Efficient Minimum Substring Partitioning
Memory Efficient Minimum Substring Partitioning Yang Li, Pegah Kamousi, Fangqiu Han, Shengqi Yang, Xifeng Yan, Subhash Suri University of California, Santa Barbara {yangli, pegah, fhan, sqyang, xyan, suri}@cs.ucsb.edu
Towards a de novo short read assembler for large genomes using cloud computing
Towards a de novo short read assembler for large genomes using cloud computing Michael Schatz April 21, 2009 AMSC664 Advanced Scientific Computing Outline 1.! Genome assembly by analogy 2.! DNA sequencing
Hybrid Parallel Programming
Hybrid Parallel Programming for Massive Graph Analysis KameshMdd Madduri KMadduri@lbl.gov ComputationalResearch Division Lawrence Berkeley National Laboratory SIAM Annual Meeting 2010 July 12, 2010 Hybrid
Nature Structural & Molecular Biology: doi: /nsmb.2467
Supplementary Figure 1. Cryo-electron tomography and GRAFIX optimization of COPII cages. a) Tomogram of Sec13-31 cages viewed along the air/water interface. The tomogram shows a large amount of disordered
Protein Crystallography
Protein Crystallography BBMB 334 Lab 4 Whitman College Program in Biochemistry, Biophysics & Molecular Biology (BBMB) Biophysics Laboratory Prof. Douglas Juers Part III. Structure Determination/Refinement
Appendix B. Finding Heavy Atoms or Anomalous Scatterers
. Finding Heavy Atoms or Anomalous Scatterers This section demonstrates the use of the programs XPREP and XM (SHELXD) to determine the locations of the three insulin disulfide groups from the set of anomalous
DNA arrays. and their various applications. Algorithmen der Bioinformatik II - SoSe Christoph Dieterich
DNA arrays and their various applications Algorithmen der Bioinformatik II - SoSe 2007 Christoph Dieterich 1 Introduction Motivation DNA microarray is a parallel approach to gene screening and target identification.