Back to Results
First PageMeta Content
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

Document Date: 2012-10-09 11:54:51

Open Document

File Size: 193,77 KB

Share Result on Facebook

City

Rennes / Paris / /

Country

France / /

IndustryTerm

depth-first search algorithm / traversal algorithm / assembly software / graph traversal algorithm / space-efficient solution / de novo assembly software / /

Person

Bromage / Conway / /

Product

Pentax K-x Digital Camera / /

Technology

partitioning algorithm / traversal algorithm / graph traversal algorithm / random access / bounded-depth / bounded-breadth BFS algorithm / search algorithm / human genome / /

URL

http /

SocialTag