How to apply de Bruijn graphs to genome assembly

First Page		Document Content
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

	Improving Bloom filter performance on sequence data using k-mer Bloom filters David Pellow1? , Darya Filippova2 , and Carl Kingsford2?? 1 The Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv 69978, Is DocID: 1vcxL - View Document
	CAREER: ABI: Assembling Extremely Large Metagenomes C. Titus Brown Monday, July 23rd, 2012 Keywords: assembly, bioinformatics, next generation sequencing, metagenomics, DocID: 1rn2w - View Document
	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 A DocID: 1rl2X - View Document
	How to apply de Bruijn graphs to genome assembly DocID: 1rgGj - View Document
	Bonn mer k hol Stoc traße S DocID: 1qNTf - View Document