SWIM: A computational tool to unveiling crucial nodes in complex biological networks

SWItchMiner (SWIM) is a wizard-like software implementation of a procedure, previously described, able to extract information contained in complex networks. Specifically, SWIM allows unearthing the existence of a new class of hubs, called "fight-club hubs", characterized by a marked negative correlation with their first nearest neighbors. Among them, a special subset of genes, called "switch genes", appears to be characterized by an unusual pattern of intra- and inter-module connections that confers them a crucial topological role, interestingly mirrored by the evidence of their clinic-biological relevance. Here, we applied SWIM to a large panel of cancer datasets from The Cancer Genome Atlas, in order to highlight switch genes that could be critically associated with the drastic changes in the physiological state of cells or tissues induced by the cancer development. We discovered that switch genes are found in all cancers we studied and they encompass protein coding genes and non-coding RNAs, recovering many known key cancer players but also many new potential biomarkers not yet characterized in cancer context. Furthermore, SWIM is amenable to detect switch genes in different organisms and cell conditions, with the potential to uncover important players in biologically relevant scenarios, including but not limited to human cancer

Membrane Systems with Priority, Dissolution, Promoters and Inhibitors and Time Petri Nets

We continue the investigations on exploring the connection between membrane systems and time Petri nets already commenced in [4] by extending membrane systems with promoters/inhibitors, membrane dissolution and priority for rules compared to the simple symbol-object membrane system. By constructing the simulating Petri net, we retain one of the main characteristics of the Petri net model, namely, the firings of the transitions can take place in any order: we do not impose any additional stipulation on the transition sequences in order to obtain a Petri net model equivalent to the general Turing machine. Instead, we substantially exploit the gain in computational strength obtained by the introduction of the timing feature for Petri nets

The Genomic Context and Corecruitment of SP1 Affect ERRα Coactivation by PGC-1α in Muscle Cells

The peroxisome proliferator-activated receptor-γ coactivator 1α (PGC-1α) coordinates the transcriptional network response to promote an improved endurance capacity in skeletal muscle, eg, by coactivating the estrogen-related receptor-α (ERRα) in the regulation of oxidative substrate metabolism. Despite a close functional relationship, the interaction between these 2 proteins has not been studied on a genomic level. We now mapped the genome-wide binding of ERRα to DNA in a skeletal muscle cell line with elevated PGC-1α and linked the DNA recruitment to global PGC-1α target gene regulation. We found that, surprisingly, ERRα coactivation by PGC-1α is only observed in the minority of all PGC-1α recruitment sites. Nevertheless, a majority of PGC-1α target gene expression is dependent on ERRα. Intriguingly, the interaction between these 2 proteins is controlled by the genomic context of response elements, in particular the relative GC and CpG content, monomeric and dimeric repeat-binding site configuration for ERRα, and adjacent recruitment of the transcription factor specificity protein 1. These findings thus not only reveal a novel insight into the regulatory network underlying muscle cell plasticity but also strongly link the genomic context of DNA-response elements to control transcription factor-coregulator interactions

Advanced optical imaging in living embryos

Developmental biology investigations have evolved from static studies of embryo anatomy and into dynamic studies of the genetic and cellular mechanisms responsible for shaping the embryo anatomy. With the advancement of fluorescent protein fusions, the ability to visualize and comprehend how thousands to millions of cells interact with one another to form tissues and organs in three dimensions (xyz) over time (t) is just beginning to be realized and exploited. In this review, we explore recent advances utilizing confocal and multi-photon time-lapse microscopy to capture gene expression, cell behavior, and embryo development. From choosing the appropriate fluorophore, to labeling strategy, to experimental set-up, and data pipeline handling, this review covers the various aspects related to acquiring and analyzing multi-dimensional data sets. These innovative techniques in multi-dimensional imaging and analysis can be applied across a number of fields in time and space including protein dynamics to cell biology to morphogenesis

Computing with cells: membrane systems - some complexity issues.

Membrane computing is a branch of natural computing which abstracts computing models from the structure and the functioning of the living cell. The main ingredients of membrane systems, called P systems, are (i) the membrane structure, which consists of a hierarchical arrangements of membranes which delimit compartments where (ii) multisets of symbols, called objects, evolve according to (iii) sets of rules which are localised and associated with compartments. By using the rules in a nondeterministic/deterministic maximally parallel manner, transitions between the system configurations can be obtained. A sequence of transitions is a computation of how the system is evolving. Various ways of controlling the transfer of objects from one membrane to another and applying the rules, as well as possibilities to dissolve, divide or create membranes have been studied. Membrane systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve currently intractable problems once future biotechnology gives way to a practical bio-realization. In this paper we survey some interesting and fundamental complexity issues such as universality vs. nonuniversality, determinism vs. nondeterminism, membrane and alphabet size hierarchies, characterizations of context-sensitive languages and other language classes and various notions of parallelism

Using membrane computing for effective homology

Effective Homology is an algebraic-topological method based on the computational concept of chain homotopy equivalence on a cell complex. Using this algebraic data structure, Effective Homology gives answers to some important computability problems in Algebraic Topology. In a discrete context, Effective Homology can be seen as a combinatorial layer given by a forest graph structure spanning every cell of the complex. In this paper, by taking as input a pixel-based 2D binary object, we present a logarithmic-time uniform solution for describing a chain homotopy operator ϕ for its adjacency graph. This solution is based on Membrane Computing techniques applied to the spanning forest problem and it can be easily extended to higher dimensions