## Finite-state discrete-time Markov chain models of gene regulatory networks

- Skornyakova M. V. Skornyakov V. P., V. ShuryginaA., Skornyakov P. V. Kogan
- 2014

The Hop eld-style network, a variant of the popular Hop eld neural network, has earlier been shown to have xed points (stable states) that correspond 1-1 with the maximal cliques of the underlying graph. The network sequentially transforms an initial state (set of vertices) to a nal state (maximal clique) via certain greedy operations. It has also been… (More)

- Clique (graph theory)
- Clique problem
- Regular language
- Greedy algorithm
- Graph - visual representation
- Computation
- Hop
- Maxima and minima
- Clique graph
- Artificial neural network
- Problem solving
- NP-completeness
- ARID1A wt Allele
- Graph (discrete mathematics)
- Conjunctive normal form
- Directed graph
- Programming Languages
- Solutions