Abstract
This article presents a formal framework for modeling computational genetic regulatory networks as automata, with multi-threshold protein concentration and combinatorial logical gene-protein interactions. By computing the intersection of the languages generated by these automata we obtain the complete set of pathways in a gene network. We illustrate the effectiveness of our framework in the modeling of (i) morphogenesis in Arabidopsis and (ii) regulation in phage lambda.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
