Computing the output distribution and selection probabilities of a stack filter from the DNF of its positive Boolean function

Many nonlinear filters used in practise are stack filters. An algorithm is presented which calculates the output distribution of an arbitrary stack filter S from the disjunctive normal form (DNF) of its underlying positive Boolean function. The so called selection probabilities can be computed along the way.Comment: This is the version published in Journal of Mathematical Imaging and Vision, online first, 1 august 201

On finite-horizon control of genetic regulatory networks with multiple hard-constraints

<p>Abstract</p> <p>Background</p> <p>Probabilistic Boolean Networks (PBNs) provide a convenient tool for studying genetic regulatory networks. There are three major approaches to develop intervention strategies: (1) resetting the state of the PBN to a desirable initial state and letting the network evolve from there, (2) changing the steady-state behavior of the genetic network by minimally altering the rule-based structure and (3) manipulating external control variables which alter the transition probabilities of the network and therefore desirably affects the dynamic evolution. Many literatures study various types of external control problems, with a common drawback of ignoring the number of times that external control(s) can be applied.</p> <p>Results</p> <p>This paper studies the intervention problem by manipulating multiple external controls in a finite time interval in a PBN. The maximum numbers of times that each control method can be applied are given. We treat the problem as an optimization problem with multi-constraints. Here we introduce an algorithm, the "Reserving Place Algorithm'', to find all optimal intervention strategies. Given a fixed number of times that a certain control method is applied, the algorithm can provide all the sub-optimal control policies. Theoretical analysis for the upper bound of the computational cost is also given. We also develop a heuristic algorithm based on Genetic Algorithm, to find the possible optimal intervention strategy for networks of large size. </p> <p>Conclusions</p> <p>Studying the finite-horizon control problem with multiple hard-constraints is meaningful. The problem proposed is NP-hard. The Reserving Place Algorithm can provide more than one optimal intervention strategies if there are. Moreover, the algorithm can find all the sub-optimal control strategies corresponding to the number of times that certain control method is conducted. To speed up the computational time, a heuristic algorithm based on Genetic Algorithm is proposed for genetic networks of large size.</p

Structure-based predictions broadly link transcription factor mutations to gene expression changes in cancers

© 2014 The Author(s). Thousands of unique mutations in transcription factors (TFs) arise in cancers, and the functional and biological roles of relatively few of these have been characterized. Here, we used structure-based methods developed specifically for DNA-binding proteins to systematically predict the consequences of mutations in several TFs that are frequently mutated in cancers. The explicit consideration of protein-DNA interactions was crucial to explain the roles and prevalence of mutations in TP53 and RUNX1 in cancers, and resulted in a higher specificity of detection for known p53-regulated genes among genetic associations between TP53 genotypes and genome-wide expression in The Cancer Genome Atlas, compared to existing methods of mutation assessment. Biophysical predictions also indicated that the relative prevalence of TP53 missense mutations in cancer is proportional to their thermodynamic impacts on protein stability and DNA binding, which is consistent with the selection for the loss of p53 transcriptional function in cancers. Structure and thermodynamics-based predictions of the impacts of missense mutations that focus on specific molecular functions may be increasingly useful for the precise and large-scale inference of aberrant molecular phenotypes in cancer and other complex diseases

КОМПЛЕКСНОЕ РАЗВИТИЕ ТРАНСПОРТНОЙ ИНФРАСТРУКТУРЫ В ПРОМЫШЛЕННЫХ РАЙОНАХ

The author analyzes main problems, occurring during pre-project studies on transport systems of large industrial regions, displays weakest points in the infrastructure of transport centers, analyzes variants of freight traffic organization; studies possibilities to enlarge capacity and operation abilities of stations and stages, potential of sorting and preparation of empty cars in the zones of mass loading. Special attention is drawn to comprehensive development of infrastructure of main and industrial transport in large nodal points.Основные проблемы, которые возникают в ходе предпроектных исследований транспортных систем, обслуживающих крупные промышленные районы. Автор выявляет «узкие места» в инфраструктуре транспортного узла, анализирует варианты организации грузопотоков, рассматривает предложения по наращиванию пропускных и перерабатывающих способностей станций и перегонов, потенциальных возможностей сортировки и подготовки порожних вагонов в зонах массовой погрузки. Особое внимание уделено при этом комплексному развитию инфраструктуры магистрального и промышленного транспорта в крупных узловых пунктах.

Addressing potential sources of variation in several non-destructive techniques for measuring firmness in apples

Measurements of firmness have traditionally been carried out according to the Magness Taylor (MT) procedure; using a texture analyser or penetrometer in reference texture tests. Non-destructive tests like the acoustic impulse response of acoustic firmness sensors (AFSs), a low-mass impact firmness sensor Sinclair International (SIQ-FT) and impact test (Lateral Impact – UPM) have also been used to measure texture and firmness. The objectives of this study were to evaluate the influence of different sources of variation in these three non-destructive tests and to evaluate their respective capabilities of discriminating between fruit maturity at two different harvest dates, turgidity before and after dehydration treatment and ripening after different storage periods. According to our results, fruit studied an unexpected AFS trend with turgidity. Contact measurements (Lateral Impact – UPM and SIQ-FT) appeared highly sensitive to changes in turgidity, but were less able to follow changes in ripening caused by storage period. Contact measurements were suitable for detecting differences between fruits from different harvest dates and showed higher correlation coefficients with reference texture tests than acoustic measurements. The Lateral Impact – UPM test proved better at separating fruits according to turgidity than the SIQ-FT instrumen

Controlling complex networks: How much energy is needed?

The outstanding problem of controlling complex networks is relevant to many areas of science and engineering, and has the potential to generate technological breakthroughs as well. We address the physically important issue of the energy required for achieving control by deriving and validating scaling laws for the lower and upper energy bounds. These bounds represent a reasonable estimate of the energy cost associated with control, and provide a step forward from the current research on controllability toward ultimate control of complex networked dynamical systems.Comment: 4 pages paper + 5 pages supplement. accepted for publication in Physical Review Letters; http://link.aps.org/doi/10.1103/PhysRevLett.108.21870

Intervention in gene regulatory networks via greedy control policies based on long-run behavior

<p>Abstract</p> <p>Background</p> <p>A salient purpose for studying gene regulatory networks is to derive intervention strategies, the goals being to identify potential drug targets and design gene-based therapeutic intervention. Optimal stochastic control based on the transition probability matrix of the underlying Markov chain has been studied extensively for probabilistic Boolean networks. Optimization is based on minimization of a cost function and a key goal of control is to reduce the steady-state probability mass of undesirable network states. Owing to computational complexity, it is difficult to apply optimal control for large networks.</p> <p>Results</p> <p>In this paper, we propose three new greedy stationary control policies by directly investigating the effects on the network long-run behavior. Similar to the recently proposed mean-first-passage-time (MFPT) control policy, these policies do not depend on minimization of a cost function and avoid the computational burden of dynamic programming. They can be used to design stationary control policies that avoid the need for a user-defined cost function because they are based directly on long-run network behavior; they can be used as an alternative to dynamic programming algorithms when the latter are computationally prohibitive; and they can be used to predict the best control gene with reduced computational complexity, even when one is employing dynamic programming to derive the final control policy. We compare the performance of these three greedy control policies and the MFPT policy using randomly generated probabilistic Boolean networks and give a preliminary example for intervening in a mammalian cell cycle network.</p> <p>Conclusion</p> <p>The newly proposed control policies have better performance in general than the MFPT policy and, as indicated by the results on the mammalian cell cycle network, they can potentially serve as future gene therapeutic intervention strategies.</p

An Evaluation of Methods for Inferring Boolean Networks from Time-Series Data

Regulatory networks play a central role in cellular behavior and decision making. Learning these regulatory networks is a major task in biology, and devising computational methods and mathematical models for this task is a major endeavor in bioinformatics. Boolean networks have been used extensively for modeling regulatory networks. In this model, the state of each gene can be either ‘on’ or ‘off’ and that next-state of a gene is updated, synchronously or asynchronously, according to a Boolean rule that is applied to the current-state of the entire system. Inferring a Boolean network from a set of experimental data entails two main steps: first, the experimental time-series data are discretized into Boolean trajectories, and then, a Boolean network is learned from these Boolean trajectories. In this paper, we consider three methods for data discretization, including a new one we propose, and three methods for learning Boolean networks, and study the performance of all possible nine combinations on four regulatory systems of varying dynamics complexities. We find that employing the right combination of methods for data discretization and network learning results in Boolean networks that capture the dynamics well and provide predictive power. Our findings are in contrast to a recent survey that placed Boolean networks on the low end of the ‘‘faithfulness to biological reality’’ and ‘‘ability to model dynamics’’ spectra. Further, contrary to the common argument in favor of Boolean networks, we find that a relatively large number of time points in the timeseries data is required to learn good Boolean networks for certain data sets. Last but not least, while methods have been proposed for inferring Boolean networks, as discussed above, missing still are publicly available implementations thereof. Here, we make our implementation of the methods available publicly in open source at http://bioinfo.cs.rice.edu/

A Mathematical Framework for Agent Based Models of Complex Biological Networks

Agent-based modeling and simulation is a useful method to study biological phenomena in a wide range of fields, from molecular biology to ecology. Since there is currently no agreed-upon standard way to specify such models it is not always easy to use published models. Also, since model descriptions are not usually given in mathematical terms, it is difficult to bring mathematical analysis tools to bear, so that models are typically studied through simulation. In order to address this issue, Grimm et al. proposed a protocol for model specification, the so-called ODD protocol, which provides a standard way to describe models. This paper proposes an addition to the ODD protocol which allows the description of an agent-based model as a dynamical system, which provides access to computational and theoretical tools for its analysis. The mathematical framework is that of algebraic models, that is, time-discrete dynamical systems with algebraic structure. It is shown by way of several examples how this mathematical specification can help with model analysis.Comment: To appear in Bulletin of Mathematical Biolog