https://github.com/isopropylcyanide/interaction-graph

Creating and analyzing interaction graphs based on boolean functions
https://github.com/isopropylcyanide/interaction-graph

boolean-function bruteforce cancer-research computation-graph cyclic-redundancy-check graph graph-algorithms java makefile molecules python research-project

Last synced: 7 months ago
JSON representation

Creating and analyzing interaction graphs based on boolean functions

• Host: GitHub
• URL: https://github.com/isopropylcyanide/interaction-graph
• Owner: isopropylcyanide
• License: mit
• Created: 2016-04-13T07:08:52.000Z (over 9 years ago)
• Default Branch: master
• Last Pushed: 2016-04-13T07:12:23.000Z (over 9 years ago)
• Last Synced: 2025-01-12T00:11:26.230Z (9 months ago)
• Topics: boolean-function, bruteforce, cancer-research, computation-graph, cyclic-redundancy-check, graph, graph-algorithms, java, makefile, molecules, python, research-project
• Language: Java
• Size: 14.7 MB
• Stars: 2
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: readme
  • License: LICENSE

Awesome Lists containing this project

README

          
#refer readme in the source folder

interaction-graphs

Attempt to create and analyze interaction graph by studying the composition of general n functions

An attempt to model biological cells and their interactions as a directed graph and to study their properties. (JAVA) The base model comprises of getting the input in the form of (n) boolean functions. After studying functional decomposition of a function in respect to other given functions, model an interaction graph that depicts the flow between any two functions. The interaction graph is further broke down into subsets which include the graphs with complete edges as well as the graph with at least a single cycle. The inputs are the combinations of n functions. Ulterior motive is to generalize the results for n functions.

Compile with : (in parent directory) $ time make nodes=N

where N is the Nodes i.e simultaneous boolean functions

Modify the comb.py file in /sources/comb.py for individual results, brute force results and for special cases. Read me has been updated for Nodes = 1, 2, 3, 4

For 4, the brute force will take an estimate 1600 years on a single i5 multicore CPU, thus extrapolation had to be required to reach a common ground for N = 4

For more details, see the screenshot attached