Paper Methodology Equations Summary
Font-Clos
et al.
(2021)
Boolean network
model
xi∈{0,1} for i=1,2,…,n, where xi is the state of
gene i. The regulatory relationships between
genes are represented by a set of logical rules: xi
=f(xi1,xi2,…,xik), where f is a Boolean function
and xi1,xi2,…,xik are the states of genes i1,i2,
…,ik.
A Boolean network model was
used to classify triple-negative
breast cancers. The model was
trained on gene expression data
from a set of 200 patients. The
model was able to correctly
classify 90% of the patients in
the test set.
Qiu (2020)
Dropout
regularization
p is the dropout rate, which is the probability of a
gene being set to zero during training.
Dropout regularization was
used to improve the
performance of single-cell
RNA-seq analysis. Dropout
regularization randomly sets a
subset of genes to zero during
training, which helps to
prevent the model from
overfitting the data.
Melkman
et al.
(2017)
Probabilistic
Boolean threshold
network
The regulatory relationships between genes are
represented by a set of probabilistic Boolean
rules: $P(x_i = 1 \$
x_{i_1}, x_{i_2}, \ldots,
x_{i_k}) = p, where p is the
probability that gene i is in the
on state if genes i1,i2,…,ik are
in the states xi1,xi2,…,xik,
respectively.
Cheng et
al. (2021)
Discrimination of
attractors with
The Hamming distance between two
attractors A and B is $d(A,B) = \sum_{i=1}^n \$
a_i - b_i\