<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Bioinformatics / NP-complete problems / Computational biology / DNA sequencing / K-mer / Velvet assembler / Eulerian path / Hamiltonian path / Degree / Seven Bridges of Knigsberg
Date: 2012-01-20 11:24:28
Graph theory
Mathematics
Bioinformatics
NP-complete problems
Computational biology
DNA sequencing
K-mer
Velvet assembler
Eulerian path
Hamiltonian path
Degree
Seven Bridges of Knigsberg

How to apply de Bruijn graphs to genome assembly

Add to Reading List

Source URL: www.nature.com

Download Document from Source Website

File Size: 415,55 KB

Share Document on Facebook

Similar Documents

Target Essentiality and Centrality Characterize Drug Side Effects Xiujuan Wang1,2., Bram Thijssen3., Haiyuan Yu1,2* 1 Department of Biological Statistics and Computational Biology, Cornell University, Ithaca, New York, U

DocID: 1vlQp - View Document

From Math to Bio Presented by: Amina Ghrissi PhD, medical data analysis, UCA, I3S MSc, Computational Biology and Biomedicine, UCA Engineer, Applied Mathematics, MIndS, ENIT

DocID: 1vl20 - View Document

IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. 12, NO. 3, MAY/JUNE 2015

DocID: 1vhfC - View Document

Genome 540 Introduction to Computational Molecular Biology: Genome and protein sequence analysis 1

DocID: 1vd1s - View Document

受験番号 Examinee number 英語版 English version 東京大学 大学院新領域創成科学研究科 情報生命科学専攻 Department of Computational Biology, Graduate School of Frontier Sciences The Universit

DocID: 1vb3E - View Document