125 research outputs found
Mammalian gene expression variability is explained by underlying cell state.
Gene expression variability in mammalian systems plays an important role in physiological and pathophysiological conditions. This variability can come from differential regulation related to cell state (extrinsic) and allele-specific transcriptional bursting (intrinsic). Yet, the relative contribution of these two distinct sources is unknown. Here, we exploit the qualitative difference in the patterns of covariance between these two sources to quantify their relative contributions to expression variance in mammalian cells. Using multiplexed error robust RNA fluorescent in situ hybridization (MERFISH), we measured the multivariate gene expression distribution of 150 genes related to Ca2+ signaling coupled with the dynamic Ca2+ response of live cells to ATP. We show that after controlling for cellular phenotypic states such as size, cell cycle stage, and Ca2+ response to ATP, the remaining variability is effectively at the Poisson limit for most genes. These findings demonstrate that the majority of expression variability results from cell state differences and that the contribution of transcriptional bursting is relatively minimal
Thermodynamically Stable DNA Code Design using a Similarity Significance Model
DNA code design aims to generate a set of DNA sequences (codewords) with
minimum likelihood of undesired hybridizations among sequences and their
reverse-complement (RC) pairs (cross-hybridization). Inspired by the distinct
hybridization affinities (or stabilities) of perfect double helix constructed
by individual single-stranded DNA (ssDNA) and its RC pair, we propose a novel
similarity significance (SS) model to measure the similarity between DNA
sequences. Particularly, instead of directly measuring the similarity of two
sequences by any metric/approach, the proposed SS works in a way to evaluate
how more likely will the undesirable hybridizations occur over the desirable
hybridizations in the presence of the two measured sequences and their RC
pairs. With this SS model, we construct thermodynamically stable DNA codes
subject to several combinatorial constraints using a sorting-based algorithm.
The proposed scheme results in DNA codes with larger code sizes and wider free
energy gaps (hence better cross-hybridization performance) compared to the
existing methods.Comment: To appear in ISIT 202
Evolutionary Computation
This book presents several recent advances on Evolutionary Computation, specially evolution-based optimization methods and hybrid algorithms for several applications, from optimization and learning to pattern recognition and bioinformatics. This book also presents new algorithms based on several analogies and metafores, where one of them is based on philosophy, specifically on the philosophy of praxis and dialectics. In this book it is also presented interesting applications on bioinformatics, specially the use of particle swarms to discover gene expression patterns in DNA microarrays. Therefore, this book features representative work on the field of evolutionary computation and applied sciences. The intended audience is graduate, undergraduate, researchers, and anyone who wishes to become familiar with the latest research work on this field
Recommended from our members
Deciphering the genetic regulatory code using an inverse error control coding framework.
We have found that developing a computational framework for reconstructing error control codes for engineered data and ultimately for deciphering genetic regulatory coding sequences is a challenging and uncharted area that will require advances in computational technology for exact solutions. Although exact solutions are desired, computational approaches that yield plausible solutions would be considered sufficient as a proof of concept to the feasibility of reverse engineering error control codes and the possibility of developing a quantitative model for understanding and engineering genetic regulation. Such evidence would help move the idea of reconstructing error control codes for engineered and biological systems from the high risk high payoff realm into the highly probable high payoff domain. Additionally this work will impact biological sensor development and the ability to model and ultimately develop defense mechanisms against bioagents that can be engineered to cause catastrophic damage. Understanding how biological organisms are able to communicate their genetic message efficiently in the presence of noise can improve our current communication protocols, a continuing research interest. Towards this end, project goals include: (1) Develop parameter estimation methods for n for block codes and for n, k, and m for convolutional codes. Use methods to determine error control (EC) code parameters for gene regulatory sequence. (2) Develop an evolutionary computing computational framework for near-optimal solutions to the algebraic code reconstruction problem. Method will be tested on engineered and biological sequences
Bounds on edit metric codes with combinatorial DNA constraints
The design of a large and reliable DNA codeword library is a key problem in DNA based
computing. DNA codes, namely sets of fixed length edit metric codewords over the alphabet
{A, C, G, T}, satisfy certain combinatorial constraints with respect to biological and
chemical restrictions of DNA strands. The primary constraints that we consider are the
reverse--complement constraint and the fixed GC--content constraint, as well as the basic
edit distance constraint between codewords.
We focus on exploring the theory underlying DNA codes and discuss several approaches to
searching for optimal DNA codes. We use Conway's lexicode algorithm and an exhaustive
search algorithm to produce provably optimal DNA codes for codes with small parameter
values. And a genetic algorithm is proposed to search for some sub--optimal DNA codes
with relatively large parameter values, where we can consider their sizes as reasonable
lower bounds of DNA codes. Furthermore, we provide tables of bounds on sizes of DNA
codes with length from 1 to 9 and minimum distance from 1 to 9
Sensing and molecular communication using synthetic cells: Theory and algorithms
Molecular communication (MC) is a novel communication paradigm in which molecules are used to encode, transmit and decode information. MC is the primary method by which biological entities exchange information and hence, cooperate with each other. MC is a promising paradigm to enable communication between nano-bio machines, e.g., biosensors with potential applications such as cancer and disease detection, smart drug delivery, toxicity detection etc. The objective of this research is to establish the fundamentals of diffusion-based molecular communication and sensing via biological agents (e.g., synthetic bacteria) from a communication and information theory perspective, and design algorithms for reliable communication and sensing systems. In the first part of the thesis, we develop models for the diffusion channel as well as the molecular sensing at the receiver and obtain the maximum achievable rate for such a communication system. Next, we study reliability in MC. We design practical nodes by employing synthetic bacteria as the basic element of a biologically-compatible communication system and show how reliable nodes can be formed out of the collective behavior of a population of unreliable bio-agents. We model the probabilistic behavior of bacteria, obtain the node sensing capacity and propose a practical modulation scheme. In order to improve the reliability, we also introduce relaying and error-detecting codes for MC. In the second part of the thesis, we study the molecular sensing problem with potential applications in disease detection. We establish the rate-distortion theory for molecular sensing and investigate as to how distortion can be minimized via an optimal quantizer.
We also study sensor cell arrays in which sensing redundancy is achieved by using multiple sensors to measure several molecular inputs simultaneously. We study the interference in sensing molecular inputs and propose a probabilistic message passing algorithm to solve the pattern detection over the molecular inputs of interest.Ph.D
Image similarity in medical images
Recent experiments have indicated a strong influence of the substrate grain orientation on the self-ordering in anodic porous alumina. Anodic porous alumina with straight pore channels grown in a stable, self-ordered manner is formed on (001) oriented Al grain, while disordered porous pattern is formed on (101) oriented Al grain with tilted pore channels growing in an unstable manner. In this work, numerical simulation of the pore growth process is carried out to understand this phenomenon. The rate-determining step of the oxide growth is assumed to be the Cabrera-Mott barrier at the oxide/electrolyte (o/e) interface, while the substrate is assumed to determine the ratio β between the ionization and oxidation reactions at the metal/oxide (m/o) interface. By numerically solving the electric field inside a growing porous alumina during anodization, the migration rates of the ions and hence the evolution of the o/e and m/o interfaces are computed. The simulated results show that pore growth is more stable when β is higher. A higher β corresponds to more Al ionized and migrating away from the m/o interface rather than being oxidized, and hence a higher retained O:Al ratio in the oxide. Experimentally measured oxygen content in the self-ordered porous alumina on (001) Al is indeed found to be about 3% higher than that in the disordered alumina on (101) Al, in agreement with the theoretical prediction. The results, therefore, suggest that ionization on (001) Al substrate is relatively easier than on (101) Al, and this leads to the more stable growth of the pore channels on (001) Al
- …