Add the example on tabulating Boolean networks.
This commit is contained in:
parent
32d117a155
commit
e7b35a451c
1 changed files with 20 additions and 0 deletions
|
@ -504,6 +504,26 @@ tab
|
||||||
| #t | #t | #t |
|
| #t | #t | #t |
|
||||||
:END:
|
:END:
|
||||||
|
|
||||||
|
Here's how to tabulate the network =simple-bn=, defined at the top
|
||||||
|
of this section:
|
||||||
|
#+BEGIN_SRC racket :results table drawer :var in-bn=munch-sexp(simple-bn)
|
||||||
|
(tabulate-boolean-network (nn (unorg in-bn)))
|
||||||
|
#+END_SRC
|
||||||
|
|
||||||
|
#+RESULTS:
|
||||||
|
:RESULTS:
|
||||||
|
| a | b | c | f-a | f-b | f-c |
|
||||||
|
| #f | #f | #f | #f | #f | #t |
|
||||||
|
| #f | #f | #t | #f | #t | #f |
|
||||||
|
| #f | #t | #f | #t | #f | #t |
|
||||||
|
| #f | #t | #t | #t | #t | #f |
|
||||||
|
| #t | #f | #f | #f | #f | #t |
|
||||||
|
| #t | #f | #t | #f | #f | #f |
|
||||||
|
| #t | #t | #f | #t | #f | #t |
|
||||||
|
| #t | #t | #t | #t | #f | #f |
|
||||||
|
:END:
|
||||||
|
|
||||||
|
|
||||||
* Reaction systems
|
* Reaction systems
|
||||||
:PROPERTIES:
|
:PROPERTIES:
|
||||||
:header-args:racket: :prologue "#lang racket\n(require graph (file \"~/Candies/prj/racket/dds/rs.rkt\") (file \"~/Candies/prj/racket/dds/utils.rkt\"))"
|
:header-args:racket: :prologue "#lang racket\n(require graph (file \"~/Candies/prj/racket/dds/rs.rkt\") (file \"~/Candies/prj/racket/dds/utils.rkt\"))"
|
||||||
|
|
Loading…
Reference in a new issue