File:Comparing de brujin graph in memory.svg

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Original file(SVG file, nominally 512 × 506 pixels, file size: 73 KB)

Summary

Description
English: A comparison of using hash tables and Bloom filters to store a de Bruijn graph in memory
Date
Source Own work
Author Emreerhan

Licensing

I, the copyright holder of this work, hereby publish it under the following license:
w:en:Creative Commons
attribution share alike
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International license.
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.

Captions

A comparison of using hash tables and Bloom filters to store a de Bruijn graph in memory

Items portrayed in this file

depicts

31 March 2019

image/svg+xml

665dcf2c26a7a19d727dac87922cbf2eca662b9b

74,880 byte

506 pixel

512 pixel

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current03:34, 1 April 2019Thumbnail for version as of 03:34, 1 April 2019512 × 506 (73 KB)EmreerhanUser created page with UploadWizard
The following pages on the English Wikipedia use this file (pages on other projects are not listed):

Global file usage

The following other wikis use this file:

Metadata