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 A - Hevea - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2013-07-16 15:28:48 Mathematics Academia Discrete mathematics Combinatorics Bioinformatics Computational biology Formal languages K-mer Substring Partition Comparison of programming languages Velvet assembler		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 Add to Reading List Source URL: www.cs.ucsb.edu Download Document from Source Website File Size: 377,75 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