In contrast with the complex series of splicing choices that generate the various membrane-associated isoforms of the neural cell-adhesion molecule alternative splicing of 5' exons does not contribute to additional molecular diversity. A single regulatory unit in genomic DNA, mapping to a 5 kb restriction-endonuclease-HindIII fragment, controls the expression of all major RNA size classes. DNA ...

CONTENT: This review covers different important aspects of promoter mutation analysis and includes a proposed model procedure for studying promoter mutations. Characterization of a promoter sequence variation includes a comprehensive study of the literature and databases of human mutations and transcription factors. Phylogenetic footprinting is also used to evaluate the putative importance of t...

BACKGROUND The engineering of many-component, synthetic biological systems is being made easier by the development of collections of reusable, standard biological parts. However, the complexity of biology makes it difficult to predict the extent to which such efforts will succeed. As a first practical example, the Registry of Standard Biological Parts started at MIT now maintains and distribute...

We show that the norm graph constructed in [13] with n vertices about 1 2n 2−1/t edges, which contains no copy of Kt,(t−1)!+1, does not contain a copy of Kt+1,(t−1)!−1.

In this paper we investigate the closure ~-* under substitution-composition of a family of graphs ~,, defined by a set Lr of forbidden configurations. We first prove that ~-* can be defined by a set L~* of forbidden subgraphs. Next, using a counterexample we show that ~* is not necessarily a finite set, even when .~ is finite. We then give a sufficient condition for ~* to be finite and a simple...

Logical structures for modeling agents’ reasoning about unawareness are presented where it can hold simultaneously that: (i) agents’ beliefs about whether they are fully aware need not be veracious with partitional information; and (ii) the agent is fully aware if and only if she is aware of a fixed domain of formulae. In light of (ii), all states are deemed “possible”. Semantics operate in two...

We characterise t-perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane triangulation is h-perfect if and only if it is perfect.