Discrimination of attractors with noisy nodes in Boolean networks

09/28/2020
by   Xiaoqing Cheng, et al.
0

Observing the internal state of the whole system using a small number of sensor nodes is important in analysis of complex networks. Here, we study the problem of determining the minimum number of sensor nodes to discriminate attractors under the assumption that each attractor has at most K noisy nodes. We present exact and approximation algorithms for this minimization problem. The effectiveness of the algorithms is also demonstrated by computational experiments using both synthetic data and realistic biological data.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

07/23/2019

Efficient Approximation Algorithms for Adaptive Seed Minimization

As a dual problem of influence maximization, the seed minimization probl...
01/11/2018

Multi-path Route Determination Method for Network Load Balancing in FAP-Based WSNs Using Fuzzy Logic

A flooding attack in wireless sensor networks is a type of threat that s...
08/22/2019

Exact inference under the perfect phylogeny model

Motivation: Many inference tools use the Perfect Phylogeny Model (PPM) t...
09/02/2020

Decentralized Source Localization Using Wireless Sensor Networks from Noisy Data

In this paper, the source (event) localization problem is studied in dec...
01/26/2013

Neural Networks Built from Unreliable Components

Recent advances in associative memory design through strutured pattern s...
11/17/2015

Active exploration of sensor networks from a robotics perspective

Traditional algorithms for robots who need to integrate into a wireless ...
11/10/2013

Learning Gaussian Graphical Models with Observed or Latent FVSs

Gaussian Graphical Models (GGMs) or Gauss Markov random fields are widel...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.