Javascript must be enabled to continue!
BionetBF: A Novel Bloom Filter for Faster Membership Identification of Large Biological Graph
View through CrossRef
ABSTRACTBig Graph is a graph having thousands of vertices and hundreds of thousands of edges. The study of graphs is crucial because the interlinkage among the vertices provides various insights and uncovers the hidden truth developed due to their relationship. The graph processing has non-linear time complexity. The overwhelming number of vertices and edges of Big Graph further enhances the processing complexity by many folds. One of the significant challenges is searching for an edge in Big Graph. This article proposes a novel Bloom Filter to determine the existence of a relationship in Big Graph, specifically biological networks. In this article, we propose a novel Bloom Filter called Biological network Bloom Filter (BionetBF) for fast membership identification of the biological network edges or paired biological data. BionetBF is capable of executing millions of operations within a second while occupying a tiny main memory footprint. We have conducted rigorous experiments to prove the performance of BionetBF with large datasets. The experiment is performed using 12 synthetic datasets and three biological network datasets. It takes less than 8 sec for insertion and query of 40 million biological edges. It demonstrates higher performance while maintaining a 0.001 false positive probability. BionetBF is compared with other filters: Cuckoo Filter and Libbloom, where small-sized BionetBF proves its supremacy by exhibiting higher performance compared with large-sized Cuckoo Filter and Libbloom. The source code is available at https://github.com/patgiri/BionetBF. The code is written in the C programming language. All data are available at the given link.HighlightsProposed a novel Bloom Filter, BionetBF, for faster boolean query on Big Graph.BionetBF has a low memory footprint and the lowest false positive probability.It has high performance with constant searching time complexity.BionetBF has the potential to application in Big Graph, de-Bruijn Graph, and Drug Discovery.
Title: BionetBF: A Novel Bloom Filter for Faster Membership Identification of Large Biological Graph
Description:
ABSTRACTBig Graph is a graph having thousands of vertices and hundreds of thousands of edges.
The study of graphs is crucial because the interlinkage among the vertices provides various insights and uncovers the hidden truth developed due to their relationship.
The graph processing has non-linear time complexity.
The overwhelming number of vertices and edges of Big Graph further enhances the processing complexity by many folds.
One of the significant challenges is searching for an edge in Big Graph.
This article proposes a novel Bloom Filter to determine the existence of a relationship in Big Graph, specifically biological networks.
In this article, we propose a novel Bloom Filter called Biological network Bloom Filter (BionetBF) for fast membership identification of the biological network edges or paired biological data.
BionetBF is capable of executing millions of operations within a second while occupying a tiny main memory footprint.
We have conducted rigorous experiments to prove the performance of BionetBF with large datasets.
The experiment is performed using 12 synthetic datasets and three biological network datasets.
It takes less than 8 sec for insertion and query of 40 million biological edges.
It demonstrates higher performance while maintaining a 0.
001 false positive probability.
BionetBF is compared with other filters: Cuckoo Filter and Libbloom, where small-sized BionetBF proves its supremacy by exhibiting higher performance compared with large-sized Cuckoo Filter and Libbloom.
The source code is available at https://github.
com/patgiri/BionetBF.
The code is written in the C programming language.
All data are available at the given link.
HighlightsProposed a novel Bloom Filter, BionetBF, for faster boolean query on Big Graph.
BionetBF has a low memory footprint and the lowest false positive probability.
It has high performance with constant searching time complexity.
BionetBF has the potential to application in Big Graph, de-Bruijn Graph, and Drug Discovery.
Related Results
A Phase 1b, Dose-Finding Study Of Ruxolitinib Plus Panobinostat In Patients With Primary Myelofibrosis (PMF), Post–Polycythemia Vera MF (PPV-MF), Or Post–Essential Thrombocythemia MF (PET-MF): Identification Of The Recommended Phase 2 Dose
A Phase 1b, Dose-Finding Study Of Ruxolitinib Plus Panobinostat In Patients With Primary Myelofibrosis (PMF), Post–Polycythemia Vera MF (PPV-MF), Or Post–Essential Thrombocythemia MF (PET-MF): Identification Of The Recommended Phase 2 Dose
Abstract
Background
Myelofibrosis (MF) is a myeloproliferative neoplasm associated with progressive, debilitating symptoms that ...
eBF: An Enhanced Bloom Filter for Intrusion Detection in IoT
eBF: An Enhanced Bloom Filter for Intrusion Detection in IoT
Abstract
Intrusion detection is an essential process to identify malicious incidents and continuously alert the many users of the Internet of Things (IoT). The constant mon...
Dynamics of Mutations in Patients with ET Treated with Imetelstat
Dynamics of Mutations in Patients with ET Treated with Imetelstat
Abstract
Background: Imetelstat, a first in class specific telomerase inhibitor, induced hematologic responses in all patients (pts) with essential thrombocythemia (...
Combinatorial Antigen Targeting Strategy for Acute Myeloid Leukemia
Combinatorial Antigen Targeting Strategy for Acute Myeloid Leukemia
Introduction: Efforts to safely and effectively treat acute myeloid leukemia (AML) by targeting a single leukemia associated antigen with chimeric antigen receptor T (CAR T) cells ...
acBF: A High Accuracy Membership Filter using rDBF
acBF: A High Accuracy Membership Filter using rDBF
Bloom Filter is a data structure for membership query which is deployed in diverse research domains to boost up system’s performance and to lower on-chip memory consumption. Howeve...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract
Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
Limited Benefit Gained From Inferior Vena Cava Filter Insertion In Patients With Advanced-Stage Cancer
Limited Benefit Gained From Inferior Vena Cava Filter Insertion In Patients With Advanced-Stage Cancer
Abstract
Introduction
Cancer and its treatment are recognized risk factors for venous thromboembolism (VTE). Inf...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...


