Receive a 20% Discount on All Purchases Directly Through IGI Global's Online Bookstore.

Additionally, libraries can receive an extra 5% discount. Learn More

Additionally, libraries can receive an extra 5% discount. Learn More

Sebastian Bauer (Charité Universitätsmedizin Berlin, Germany) and Peter Robinson (Charité Universitätsmedizin Berlin, Germany)

Copyright: © 2010
|Pages: 22

DOI: 10.4018/978-1-60566-685-3.ch003

Chapter Preview

TopGRNs coordinate the changes in cellular behavior associated with development or response of the cell or organism to extracellular stimuli. Transcription factors are the molecules that activate or repress downstream genes by binding to promoter and other sequences (cis-regulatory modules) of genes, thereby modulating the rate of transcription of genes. Combinations of transcription factor binding events in any one promoter are one of the important factors determining the level of the corresponding mRNA in the cell. The regulatory state of the cell has been described as the total set of active transcription factors. However, a number of other molecules influence the activation state and concentration of transcription factors. For instance, signaling pathways consisting of ten or hundreds of proteins can transduce an extracellular event (such as the binding of a ligand to a receptor) into an intracellular biochemical signal by cascading protein modification events. For instance, a receptor-ligand binding event may induce phosphorylation (and activation) of an intracellular signaling molecule, which in turn phosphorylates other molecules, thereby propagating the signal through a cascade or network of proteins, some of which activate transcription factors and thereby influence the transcription of target genes. Other factors, such as non-coding RNAs, histone modifications, and CpG methylation, can also influence the level of mRNA of target genes. Therefore, measurement of mRNA levels can provide only a partial view of the regulatory state of a cell. At present, however, there remain major technical difficulties in obtaining large-scale measurements of protein levels or protein modifications, so that network structural inference has for the most part been attempted with mRNA data.

Graphs are abstract entities of discrete mathematics which are used to encode relationships of interest between objects of the same domain. Formally, a *graph* is a pair *G*=(*V*,*E*), in which *V* is finite set of *vertices*, representing the objects, and *E* a set of pairs of distinct elements of *V*, which is a binary relation over *V*. Elements of *E* are called *edges* (or arcs). The pairs may be ordered or not. An order implies a *direction*. If all edges of *G* are directed, the graph is *directed*. If at least one edge is directed we call the graph a *partially directed graph*. Otherwise the graph is an *undirected graph*.

A *path* with length *n* is a sequence of vertices (*v*_{1},...,*v _{n}*) which respects the edges, i.e., for all

Sparse Candidate Algorithm: The SCA is an approximation algorithm for the problem of finding a structure of a Bayesian network that maximizes a given Bayesian scoring metrics. It employs the feature that biological networks are usually sparse and consists of two phases, the restriction and the maximization phase.

Priors: A prior can be specified during a learning procedure that takes advantage of Bayes’ theorem and may represent properties that are already known and therefore don’t need to be rediscovered. It is especially useful when data is sparse, which is the case in micro array analysis, as it can significantly reduce the space of all DAGs that is used during the search.

Bayesian Scoring Metrics: A Bayesian Scoring Metric is a function that scores how well a given graph explains given data.

MCMC: The MCMC (Markov chain Monte Carlo) is a procedure which allows sampling instances from complex probability distribution. With respect to GRNs MCMC is used to sample from the space of all DAGs whereby the sampling scheme follows a distribution that is based on a Bayesian scoring metrics. Thus more probable DAGs, that is, DAGs that may better explain the data, are sampled more often and therefore one can construct a likely network structure.

Bayesian Networks: A Bayesian network is a probabilistic graphical model. It contains of a graph whose vertices represent variables, for instance random variables. The directed edges of the graph encode direct dependency relation of one variable to another. Bayesian networks can be used to predict the state of variables, when other variables are fixed. In addition, Bayesian networks can be learned from sampled data.

Search this Book:

Reset

Copyright © 1988-2018, IGI Global - All Rights Reserved