Login / Signup
Konnector: Connecting paired-end reads using a bloom filter de Bruijn graph.
Benjamin P. Vandervalk
Shaun D. Jackman
Anthony Raymond
Hamid Mohamadi
Chen Yang
Dean A. Attali
Justin Chu
René L. Warren
Inanç Birol
Published in:
BIBM (2014)
Keyphrases
</>
bloom filter
graph structure
join processing
data structure
record linkage
graph representation
random walk
weighted graph
graph theoretic
graph theory
graphical models
space efficient
directed graph
graph mining
graph model
neural network
graph databases
data model
learning algorithm