Space-efficient and exact de Bruijn graph representation based on a Bloom filter Rayan Chikhi1 and Guillaume Rizk2 1 Computer Science department, ENS Cachan IRISA, 35042 Rennes, France - Depth filter - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2012-10-09 11:54:51 Bit array Connectivity De Bruijn graph Depth-first search De Bruijn Velvet assembler Koorde Graph theory Hashing Bloom filter		Space-efficient and exact de Bruijn graph representation based on a Bloom filter Rayan Chikhi1 and Guillaume Rizk2 1 Computer Science department, ENS Cachan/IRISA, 35042 Rennes, France Add to Reading List Source URL: minia.genouest.org Download Document from Source Website File Size: 193,77 KB Share Document on Facebook

	Source-side Preordering for Translation using Logistic Regression and Depth-first Branch-and-Bound Search∗ Laura Jehl? ? Adri`a de Gispert‡ DocID: 1uXFc - View Document
	Structuring Depth-First Search Algorithms in Haskell David J. King John Launchbury Department of Computing Science DocID: 1uNEx - View Document
	A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud DocID: 1ueLR - View Document
	A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud DocID: 1tFfm - View Document
	Selective Depth-First Search Methods Yngvi Bj¨ ornsson and Tony Marsland Department of Computing Science University of Alberta Edmonton, Alberta DocID: 1tFcX - View Document