Control of alternative pre-mRNA splicing by distributed pentameric repeats

Multiple copies of the hexamer TGCATG have been shown to regulate fibronectin pre-mRNA alternative splicing. GCATG repeats also are clustered near the regulated calcitonin-specific 3′ splice site in the rat calcitonin/CGRP gene. Specific mutagenesis of these repeats in calcitonin/CGRP pre-mRNA resulted in the loss of calcitonin-specific splicing, suggesting that the native repeats act to enhance alternative exon inclusion. Mutation of subsets of these elements implies that alternative splicing requires a minimum of two repeats, and that the combination of one intronic and one exonic repeat is necessary for optimal cell-specific splicing. However, multimerized intronic repeats inhibited calcitonin-specific splicing in both the wild-type context and in a transcript lacking endogenous repeats. These results suggest that both the number and distribution of repeats may be important features for the regulation of tissue-specific alternative splicing. Further, RNA containing a single repeat bound cell-specific protein complexes, but tissue-specific differences in protein binding were not detected by using multimerized repeats. Together, these data support a novel model for alternative splicing regulation that requires the cell-specific recognition of multiple, distributed sequence elements.

On the controllability of distributed systems

To “control” a system is to make it behave (hopefully) according to our “wishes,” in a way compatible with safety and ethics, at the least possible cost. The systems considered here are distributed—i.e., governed (modeled) by partial differential equations (PDEs) of evolution. Our “wish” is to drive the system in a given time, by an adequate choice of the controls, from a given initial state to a final given state, which is the target. If this can be achieved (respectively, if we can reach any “neighborhood” of the target) the system, with the controls at our disposal, is exactly (respectively, approximately) controllable. A very general (and fuzzy) idea is that the more a system is “unstable” (chaotic, turbulent) the “simplest,” or the “cheapest,” it is to achieve exact or approximate controllability. When the PDEs are the Navier–Stokes equations, it leads to conjectures, which are presented and explained. Recent results, reported in this expository paper, essentially prove the conjectures in two space dimensions. In three space dimensions, a large number of new questions arise, some new results support (without proving) the conjectures, such as generic controllability and cases of decrease of cost of control when the instability increases. Short comments are made on models arising in climatology, thermoelasticity, non-Newtonian fluids, and molecular chemistry. The Introduction of the paper and the first part of all sections are not technical. Many open questions are mentioned in the text.

Using three-dimensional microfluidic networks for solving computationally hard problems

This paper describes the design of a parallel algorithm that uses moving fluids in a three-dimensional microfluidic system to solve a nondeterministically polynomial complete problem (the maximal clique problem) in polynomial time. This algorithm relies on (i) parallel fabrication of the microfluidic system, (ii) parallel searching of all potential solutions by using fluid flow, and (iii) parallel optical readout of all solutions. This algorithm was implemented to solve the maximal clique problem for a simple graph with six vertices. The successful implementation of this algorithm to compute solutions for small-size graphs with fluids in microchannels is not useful, per se, but does suggest broader application for microfluidics in computation and control.