Efficient graph-color compression with neighborhood-informed Bloom filters

Ingo Schilken; Harun Mustafa; Gunnar Rätsch; Carsten Eickhoff; Andre Kahles

doi:10.1101/239806

Article Information

doi

https://doi.org/10.1101/239806

History

December 26, 2017.

Article Versions

You are currently viewing Version 1 of this article (December 26, 2017 - 03:38).
View Version 2, the most recent version of this article.

The copyright holder for this preprint is the author/funder, who has granted bioRxiv a license to display the preprint in perpetuity. It is made available under a CC-BY-NC 4.0 International license.

Author Information

Ingo Schilken1,
Harun Mustafa1,2,
Gunnar Rätsch1,2,
Carsten Eickhoff1 and
Andre Kahles1,2

¹ETH Zurich, Department of Computer Science, Zurich, Switzerland
²University Hospital Zurich, Biomedical Informatics Research, Zurich, Switzerland

View the discussion thread.

Posted December 26, 2017.

Download PDF

Supplementary Material

Citation Tools

Subject Area

Bioinformatics

Subject Areas

All Articles

Animal Behavior and Cognition (3598)
Biochemistry (7567)
Bioengineering (5517)
Bioinformatics (20779)
Biophysics (10325)
Cancer Biology (7973)
Cell Biology (11629)
Clinical Trials (138)
Developmental Biology (6602)
Ecology (10198)
Epidemiology (2065)
Evolutionary Biology (13605)
Genetics (9537)
Genomics (12843)
Immunology (7919)
Microbiology (19536)
Molecular Biology (7654)
Neuroscience (42055)
Paleontology (307)
Pathology (1257)
Pharmacology and Toxicology (2200)
Physiology (3266)
Plant Biology (7036)
Scientific Communication and Education (1294)
Synthetic Biology (1951)
Systems Biology (5426)
Zoology (1115)

Efficient graph-color compression with neighborhood-informed Bloom filters

Article Information

Article Versions

Author Information

Citation Manager Formats

Subject Area