SUMMARY Citrus tristeza virus (CTV) has within the 3'-half of the genome ten open reading frames (ORFs) that are expressed through a series of 3'-coterminal subgenomic (sg) messenger (m)RNAs that, in general, function as monocistronic mRNAs with only the 5'-most ORF translated. Yet only nine sg mRNAs have been detected, suggesting that ORF 3, which is predicted to encode a small hydrophobic pro...

A genetic analysis of Escherichia coli P6, a large-cell, radiation-resistant strain of E. coli, established that it originated as the result of a mutational event. The gene responsible for the complex P6 phenotype was located at 61 +/- 0.5 min on the E. coli linkage map. The close resemblance of conjugal and transductional recombinants to one or the other parent without indication of an interme...

In [3], Faudree and Gould showed that if a 2-connected graph contains no K1,3 and P6 as an induced subgraph, then the graph is hamiltonian. In this paper, we consider the extension of this result to cycles passing through specified vertices. We define the families of graphs which are extension of the forbidden pair K1,3 and P6, and prove that the forbidden families implies the existence of cycl...

An antimicrobial protein from seeds of Pharbitis nil (Pn-AMP) which shows an antifungal activity towards several agriculturally important plant pathogens has been crystallized in the presence of equimolar N-acetylglucosamine with sodium citrate as precipitant. The crystal belongs to the hexagonal space group P6(1)22 (or P6(5)22), with unit-cell parameters a = b = 29.33 (5), c = 133.44 (12) A. N...

UNLABELLED Phosphorylation of the RelA subunit at serine 536 (RelA-P-Ser536) is important for hepatic myofibroblast survival and is mechanistically implicated in liver fibrosis. Here, we show that a cell-permeable competing peptide (P6) functions as a specific targeted inhibitor of RelA-P-Ser536 in vivo and exerts an antifibrogenic effect in two progressive liver disease models, but does not im...

We prove three complexity results on vertex coloring problems restricted to Pk-free graphs, i.e., graphs that do not contain a path on k vertices as an induced subgraph. First of all, we show that the pre-coloring extension version of 5-coloring remains NP-complete when restricted to P6-free graphs. Recent results of Hoàng et al. imply that this problem is polynomially solvable on P5-free graph...

We prove three complexity results on vertex coloring problems restricted to Pk-free graphs, i.e., graphs that do not contain a path on k vertices as an induced subgraph. First of all, we show that the pre-coloring extension version of 5-coloring remains NP-complete when restricted to P6-free graphs. Recent results of Hoàng et al. imply that this problem is polynomially solvable on P5-free graph...

TheMaximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for P6-free graphs is unknown. In this note, we show that the MWIS problem can be solved in time O(nm) for (P6, banner)-free graphs by analyzing the structure of subclasses of these class of graphs. This extend...

The stable set polytope of a graph G, denoted as STAB(G), is the convex hull of all the incidence vectors of stable sets of G. To describe a linear system which defines STAB(G) seems to be a difficult task in the general case. In this paper we present a complete description of the stable set polytope of (P6,triangle)-free graphs (and more generally of (P6,paw)-free graphs). For that we combine ...

The definition of 'symmetry element' given in the Report of the IUCr Ad-Hoc Committee on the Nomenclature of Symmetry by de Wolff et al. [Acta Cryst. (1989). A45, 494-499] is shown to contain an ambiguity in the case of space groups P6/m, P6/mmm, P6/mcc and point groups 6/m and 6/mmm. The ambiguity is removed by redefining the 'geometric element' as a labelled geometric item in which the label ...