Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
January 1, 2013Algorithms for Molecular BiologyOpen Access

Space-efficient and exact de Bruijn graph representation based on a Bloom filter

View Full Paper
Ask AI
Bookmark
Share

Authors

RCRayan ChikhiInstitut PasteurGRGuillaume RizkÉcole Normale Supérieure Paris-Saclay

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Chikhi et al. (2013) studied this question.

synapsesocial.com/papers/69e7735dc8658f113bcb1885https://doi.org/10.1186/1748-7188-8-22
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Exploiting sparseness in de novo genome assembly2012 · 432 citations
  2. 2GAGE: A critical evaluation of genome assemblies and assembly algorithms2011 · 754 citations
  3. 3DSK: <i>k</i>-mer counting with very low memory usage2013 · 312 citations
  4. 4The Bloomier filter: an efficient data structure for static support lookup tables2004 · 332 citations
  5. 5A fast, lock-free approach for efficient parallel counting of occurrences of <i>k</i> -mers2011 · 5,236 citations