ALBERT

Description: Background: There are recent experimental reports on the cross‐regulation between molecules involved in the control of the cell cycle and the differentiation of the vulval precursor cells (VPCs) of Caenorhabditis elegans. Such discoveries provide novel clues on how the molecular mechanisms involved in the cell cycle and cell differentiation processes are coordinated during vulval development. Dynamic computational models are helpful to understand the integrated regulatory mechanisms affecting these cellular processes. Results: Here we propose a simplified model of the regulatory network that includes sufficient molecules involved in the control of both the cell cycle and cell differentiation in the C. elegans vulva to recover their dynamic behavior. We first infer both the topology and the update rules of the cell cycle module from an expected time series. Next, we use a symbolic algorithmic approach to find which interactions must be included in the regulatory network. Finally, we use a continuous‐time version of the update rules for the cell cycle module to validate the cyclic behavior of the network, as well as to rule out the presence of potential artifacts due to the synchronous updating of the discrete model. We analyze the dynamical behavior of the model for the wild type and several mutants, finding that most of the results are consistent with published experimental results. Conclusions: Our model shows that the regulation of Notch signaling by the cell cycle preserves the potential of the VPCs and the three vulval fates to differentiate and de‐differentiate, allowing them to remain completely responsive to the concentration of LIN‐3 and lateral signal in the extracellular microenvironment.

Description: Background Spiroplasma is a widely distributed endosymbiont of insects, arthropods, and plants. In insects, Spiroplasma colonizes the gut, hemolymph, and reproductive organs of the host. Previous metagenomic surveys of the domesticated carmine cochineal Dactylopius coccus and the wild cochineal D. opuntiae reported sequences of Spiroplasma associated with these insects. However, there is no analysis of the genomic capabilities and the interaction of this Spiroplasma with Dactylopius. Results Here we present three Spiroplasma genomes independently recovered from metagenomes of adult males and females of D. coccus, from two different populations, as well as from adult females of D. opuntiae. Single-copy gene analysis showed that these genomes were 〉 92% complete. Phylogenomic analyses classified these genomes as new members of Spiroplasma ixodetis. Comparative genome analysis indicated that they exhibit fewer genes involved in amino acid and carbon catabolism compared to other spiroplasmas. Moreover, virulence factor-encoding genes (i.e., glpO, spaid and rip2) were found incomplete in these S. ixodetis genomes. We also detected an enrichment of genes encoding the type IV secretion system (T4SS) in S. ixodetis genomes of Dactylopius. A metratranscriptomic analysis of D. coccus showed that some of these T4SS genes (i.e., traG, virB4 and virD4) in addition to the superoxide dismutase sodA of S. ixodetis were overexpressed in the ovaries. Conclusion The symbiont S. ixodetis is a new member of the bacterial community of D. coccus and D. opuntiae. The recovery of incomplete virulence factor-encoding genes in S. ixodetis of Dactylopius suggests that this bacterium is a non-pathogenic symbiont. A high number of genes encoding the T4SS, in the S. ixodetis genomes and the overexpression of these genes in the ovary and hemolymph of the host suggest that S. ixodetis use the T4SS to interact with the Dactylopius cells. Moreover, the transcriptional differences of S. ixodetis among the gut, hemolymph and ovary tissues of D. coccus indicate that this bacterium can respond and adapt to the different conditions (e.g., oxidative stress) present within the host. All this evidence proposes that there is a strong interaction and molecular signaling in the symbiosis between S. ixodetis and the carmine cochineal Dactylopius.

Description: Background In Thomas' formalism for modeling gene regulatory networks (GRNs), branching time, where a state can have more than one possible future, plays a prominent role. By representing a certain degree of unpredictability, branching time can model several important phenomena, such as (a) asynchrony, (b) incompletely specified behavior, and (c) interaction with the environment. Introducing more than one possible future for a state, however, creates a difficulty for ordinary simulators, because infinitely many paths may appear, limiting ordinary simulators to statistical conclusions. Model checkers for branching time, by contrast, are able to prove properties in the presence of infinitely many paths. Results We have developed Antelope ("Analysis of Networks through TEmporal-LOgic sPEcifications", http://turing.iimas.unam.mx:8080/AntelopeWEB/), a model checker for analyzing and constructing Boolean GRNs. Currently, software systems for Boolean GRNs use branching time almost exclusively for asynchrony. Antelope, by contrast, also uses branching time for incompletely specified behavior and environment interaction. We show the usefulness of modeling these two phenomena in the development of a Boolean GRN of the Arabidopsis thaliana root stem cell niche. There are two obstacles to a direct approach when applying model checking to Boolean GRN analysis. First, ordinary model checkers normally only verify whether or not a given set of model states has a given property. In comparison, a model checker for Boolean GRNs is preferable if it reports the set of states having a desired property. Second, for efficiency, the expressiveness of many model checkers is limited, resulting in the inability to express some interesting properties of Boolean GRNs. Antelope tries to overcome these two drawbacks: Apart from reporting the set of all states having a given property, our model checker can express, at the expense of efficiency, some properties that ordinary model checkers (e.g., NuSMV) cannot. This additional expressiveness is achieved by employing a logic extending the standard Computation-Tree Logic (CTL) with hybrid-logic operators. Conclusions We illustrate the advantages of Antelope when (a) modeling incomplete networks and environment interaction, (b) exhibiting the set of all states having a given property, and (c) representing Boolean GRN properties with hybrid CTL.