4
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Exact Identification of the Structure of a Probabilistic Boolean Network from Samples

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references29

          • Record: found
          • Abstract: found
          • Article: not found

          Probabilistic Boolean Networks: a rule-based uncertainty model for gene regulatory networks.

          Our goal is to construct a model for genetic regulatory networks such that the model class: (i) incorporates rule-based dependencies between genes; (ii) allows the systematic study of global network dynamics; (iii) is able to cope with uncertainty, both in the data and the model selection; and (iv) permits the quantification of the relative influence and sensitivity of genes in their interactions with other genes. We introduce Probabilistic Boolean Networks (PBN) that share the appealing rule-based properties of Boolean networks, but are robust in the face of uncertainty. We show how the dynamics of these networks can be studied in the probabilistic context of Markov chains, with standard Boolean networks being special cases. Then, we discuss the relationship between PBNs and Bayesian networks--a family of graphical models that explicitly represent probabilistic relationships between variables. We show how probabilistic dependencies between a gene and its parent genes, constituting the basic building blocks of Bayesian networks, can be obtained from PBNs. Finally, we present methods for quantifying the influence of genes on other genes, within the context of PBNs. Examples illustrating the above concepts are presented throughout the paper.
            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Inferring qualitative relations in genetic networks and metabolic pathways.

            Inferring genetic network architecture from time series data of gene expression patterns is an important topic in bioinformatics. Although inference algorithms based on the Boolean network were proposed, the Boolean network was not sufficient as a model of a genetic network. First, a Boolean network model with noise is proposed, together with an inference algorithm for it. Next, a qualitative network model is proposed, in which regulation rules are represented as qualitative rules and embedded in the network structure. Algorithms are also presented for inferring qualitative relations from time series data. Then, an algorithm for inferring S-systems (synergistic and saturable systems) from time series data is presented, where S-systems are based on a particular kind of nonlinear differential equation and have been applied to the analysis of various biological systems. Theoretical results are shown for Boolean networks with noises and simple qualitative networks. Computational results are shown for Boolean networks with noises and S-systems, where real data are not used because the proposed models are still conceptual and the quantity and quality of currently available data are not enough for the application of the proposed methods.
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              A model of transcriptional regulatory networks based on biases in the observed regulation rules

                Bookmark

                Author and article information

                Journal
                IEEE/ACM Transactions on Computational Biology and Bioinformatics
                IEEE/ACM Trans. Comput. Biol. and Bioinf.
                Institute of Electrical and Electronics Engineers (IEEE)
                1545-5963
                1557-9964
                2374-0043
                November 1 2016
                November 1 2016
                : 13
                : 6
                : 1107-1116
                Article
                10.1109/TCBB.2015.2505310
                5d3f5ee5-f9f9-4b50-8d4b-e2a81ec46dac
                © 2016
                History

                Comments

                Comment on this article