Kauffman networks: Analysis and applications

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn 2005, Issue , 2005, Pages 479-484

  Dubrova, Elena ^a   Teslenko, Maxim ^a   Martinelli, Andres ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTIONS; GENES; MUTAGENESIS; PROBLEM SOLVING; SOFTWARE ENGINEERING; STATISTICAL METHODS; VIRUSES;

GENE REGULATORY NETWORKS; KAUFFMAN NETWORKS; MUTATIONS; SOFTWARE PACKAGE;

GENETIC ENGINEERING;

EID: 33751394685     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2005.1560115     Document Type: Conference Paper

References (44)

1. B. Alberts, D. Bray, J. Lewis, M. Ra, K. Roberts, and J. D. Watson, Molecular Biology of the Cell. New York: Garland Publishing, 1994.
2. F. Jacob and J. Monod, "Genetic regulatory mechanisms in the synthesis of proteins," Journal of Molecular Biology, vol. 3, pp. 318-356, 1961.
3. S. A. Kauffman, "Metabolic stability and epigenesis in randomly constructed nets," Journal of Theoretical Biology, vol. 22, pp. 437-467, 1969.
4. U. Bastola and G. Parisi, "Relevant elements, magnetization and dynamic properties in Kauffman networks: a numerical study," Physica D, vol. 115, p. 203, 1998.
5. M. Berkelaar and K. M. van Eijk, "Efficient and effective redundancy removal for million-gate circuits," in Proceedings of the Design, Automation and Test in Europe Conference and Exhibition, p. 1088, IEEE Computer Society Press, 2002.
6. Z. Somogyvari and S. Payrits, "Length of state cycles of random boolean networks: an analytic study," Journal of Physics A: Mathematical and General, vol. 33, pp. 6699-6706, 2000.
7. K. L. McMillan, Symbolic Model Checking. Boston, MA: Kluwer Academic Publishers, 1993.
8. 20 States and Beyond," in Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, (Washington, D.C.), pp. 1-33, IEEE Computer Society Press, 1990.
9. U. Bastola and G. Parisi, "The modular structure of Kauffman networks," Phys. D, vol. 115, p. 219, 1998.
10. A. Wuensche, "The DDlab manual," 2000. http://www.cogs.susx.ac. uk/users/andywu/man_contents.html.
11. S. Bilke and F. Sjunnesson, "Stability of the Kauffman model," Physical Review E, vol. 65, p. 016129, 2001.
12. J. E. S. Socolar and S. A. Kauffman, "Scaling in ordered and critical random Boolean networks." http://arXiv.org/abs/cond-mat/0212306.
13. J. Shelley, "Here we go again," 29 December 2004. http://www.gdnctr.com/dec_29_00.htm.
14. E. Dubrova, M. Teslenko, and H. Tenhunen, "Computing attractors in dynamic networks," in Proceedings of International Symposium on Applied Computing (IADIS'2005), (Algarve, Portugal), pp. 535-543, February 2005.
15. E. Dubrova, "Modeling of gene regulatory systems by Random Boolean Networks," in Microtechnologies for the New Millennium, (Sevilla, Spain), May 2005.
16. E. Dubrova and M. Teslenko, "Compositional properties of Random Boolean Networks," Physical Review E, 2005. to appear.
17. M. Aldana, S. Coopersmith, and L. P. Kadanoff, "Boolean dynamics with random couplings." http://arXiv.org/abs/adap-org/9305001.
18. H. Atlan, F. Fogelman-Soulie, J. Salomon, and G. Weisbuch, "Random Boolean networks," Cybernetics and System, vol. 12, pp. 103-121, 2001.
19. V. G. Redko, "Kauffman's nk boolean networks," 1998. http://pespmcl.vub.ac.be/BOOLNETW.html.
20. B. Derrida and Y. Pomeau, "Random networks of automata: a simple annealed approximation," Biophys. Lett., vol. 1, p. 45, 1986.
21. H. Flyvbjerg and N. J. Kjaer, "Exact solution of Kauffman model with connectivity one," J. Phys. A: Math. Gen., vol. 21, p. 1695, 1988.
22. B. Luque and R. V. Sole, "Stable core and chaos control in Random boolean networks," Journal of Physics A: Mathematical and General, vol. 31, pp. 1533-1537, 1998.
23. U. Bastola and G. Parisi, "The critical line of Kauffman networks," J. Theor. Biol., vol. 187, p. 117, 1997.
24. S. A. Kauffman, The Origins of Order: Self-Organization and Selection of Evolution. Oxford: Oxford University Press, 1993.
25. S. Huang and D. E. Ingber, "Shape-dependent control of cell growth, differentiation, and apoptosis: Switching between attractors in cell regulatory networks," Experimental Cell Research, vol. 261, pp. 91-103, 2000.
26. S. A. Kauffman and E. D. Weinberger, "The nk model of rugged fitness landscapes and its application to maturation of the immune response," Journal of Theoretical Biology, vol. 141, pp. 211-245, 1989.
27. S. Bornholdt and T. Rohlf, "Topological evolution of dynamical networks: Global criticality from local dynamics," Physical Review Letters, vol. 84, pp. 6114-6117, 2000.
28. B. Derrida and H. Flyvbjerg, "Multivalley structure in Kauffman's model: Analogy with spin glass," J. Phys. A: Math. Gen., vol. 19, p. L1103, 1986.
29. A. Y. Liu and L. D. True, "Characterization of prostate cell types by cd cell surface molecules," The American Journal of Pathology, vol. 160, pp. 37-43, 2002.
30. R. Dawkins, The Selfish Gene. Oxford: Oxford University Press, 1989.
31. J. Suurkula, "Over 95 percent of DNA has largely unknown function," 2004. http://www.psrast.org/junkdna.htm.
32. R. E. Tarjan, "Depth-first search and linear graph algorithms," SIAM Journal on Computing, vol. 1, no. 2, pp. 146-160, 1972.
33. R. Bryant, "Graph-based algorithms for Boolean function manipulation," Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 35, pp. 677-691, August 1986.
34. J. Burch, E. Clarke, D. E. Long, K. McMillan, and D. Dill, "Symbolic Model Checking for sequential circuit verification," Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 13, pp. 401-442, April 1994.
35. M. Molloy and B. Reed, "The size of the giant component of a random graph with a given degree sequence," Combin. Probab. Comput., vol. 7, pp. 295-305, 1998.
36. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, "Symbolic model checking without BDDs," in 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems, (Amsterdam, The Netherlands), pp. 193-207, March 1999.
37. P. Abdula, P. Bjesse, and N. Een, "Symbolic reachability analysis based on SAT-solvers," in Proceedings of the 6th International Conference on Tools and Algorithms for the Analysis and Construction of Systems (TACAS'2000), vol. 1785 of LNCS, Springer-Verlag, 2000.
38. A. Kuehlmann, M. K. Ganai, and V. Paruthi, "Circuit-based Boolean reasoning," in Proceedings of the 38th ACM/IEEE Design Automation Conference, (Las Vegas, Nevada), pp. 232-237, June 2001.
39. P. Bjesse, "DAG-aware circuit compression for formal verification," in Proceedings of the IEEE/ACM International Conference on ComputerAided Design, pp. 42-49, November 2004.
40. S. M. Reddy, W. Kunz, and D. K. Pradhan, "Novel verification framework combining structural and OBDD methods in a synthesis environment," in Proceedings of the 32th ACM/IEEE Design Automation Conference, (San Francisco), pp. 414-419, June 1995.
41. P. F. Williams, A. Biere, E. M. Clarke, and A. Gupta, "Combining decision diagrams and SAT procedures for efficient symbolic model checking," in Computer Aided Verification (CAV'00), (Chicago, IL), pp. 125-138, Springer-Verlag, July 2000.
42. C. A. J. van Eijk and J. A. G. Jess, "Detection of equivalent state variables in finite state machine verification," in 1995 ACM/IEEE International Workshop on Logic Synthesis, (Tahoe City, CA), pp. 3-35 -3-44, May 1995.
43. D. Geist and I. Beer, "Efficient model checking by automated ordering of transition relation partitions," in Computer Aided Verification (CAV'94), (Stanford), pp. 299-310, Springer-Verlag, July 1994.
44. K. D. Birnbaum, D. E. Shasha, J. Y. Wang, J. W. Jung, G. M. Lambert, D. W. Galbraith, and P. N. Benfey, "A global view of cellular identity in the Arabidopsis root," in Proceedings of the International Conference on Arabidopsis Research, (Berlin, Germany), July 2004.