The ArcB and ArcA proteins constitute a two-component signal transduction system that plays a broad role in transcriptional regulation. Under anoxic or environmentally reducing conditions, the sensor kinase (ArcB) is stimulated to autophosphorylate at the expense of ATP and subsequently transphosphorylates the response regulator (ArcA). ArcB is a complex, membrane-bound protein comprising at le...

Proof. Clearly, the image of F is HK by definition. To see that F is injective, suppose that F (h1, k1) = F (h2, k2). Then by definition h1k1 = h2k2. Thus h −1 2 h1 = k2k −1 1 . Since H is a subgroup, h−1 2 h1 ∈ H, and since K is a subgroup, k2k −1 1 ∈ K. Thus h−1 2 h1 = k2k −1 1 ∈ H ∩ K = {1}, and so h −1 2 h1 = k2k −1 1 = 1. It follows that h−1 2 h1 = 1, so that h1 = h2, and similarly k2k −1 ...

Perilipins regulate triacylglycerol storage and hydrolysis in adipocytes. The central 25% of the perilipin A sequence, including three hydrophobic sequences (H1, H2, and H3) and an acidic region, targets and anchors perilipins to lipid droplets. Thus, we hypothesized that H1, H2, and H3 are targeting and anchoring motifs. We now show that deletion of any single hydrophobic sequence or combinati...

The human has two relaxins, termed H1 and H2, both of which are biologically active and co-expressed in the decidua, placenta and prostate; in the corpus luteum, the main source of circulating relaxin, only the H2 form is expressed. The reasons for this differential expression of the relaxin genes are unknown. The possibility that their 3'-untranslated regions (UTRs) contribute to this differen...

This study considers scheduling in Hybrid flow shop environment with unrelated parallel machines for minimizing mean of job's tardiness and mean of job's completion times. This problem does not study in the literature, so far. Flexible flow shop environment is applicable in various industries such as wire and spring manufacturing, electronic industries and production lines. After modeling the p...

To obtain a contradiction, suppose that there is a cycle; this implies that so that there are q ≥ 2 different governments H1, . . . ,Hq such that φ (Hj) = Hj+1 for all 1 ≤ j < q, and φ (Hq) = H1. Without loss of generality, let H1 be the least competent of these governments. Take H = φ (H2) (if q > 2 then H = H3 and if q = 2 then H = H1). As φ is a political equilibrium, Vi (H) > Vi (H2) holds ...

Given bipartite graphs H1 and H2, the bipartite Ramsey number b(H1;H2) is the smallest integer b such that any subgraph G of the complete bipartite graph Kb,b, either G contains a copy of H1 or its complement relative to Kb,b contains a copy of H2. It is known that b(K2,2;K2,2) = 5, b(K2,3;K2,3) = 9, b(K2,4;K2,4) = 14 and b(K3,3;K3,3) = 17. In this paper we study the case H1 being even cycles a...

A graph is (H1,H2)-free for a pair of graphsH1, H2 if it contains no induced subgraph isomorphic toH1 orH2. In 2001, Král’, Kratochvíl, Tuza, and Woeginger initiated a study into the complexity of Colouring for (H1,H2)free graphs. Since then, others have tried to complete their study, but many cases remain open. We focus on those (H1,H2)-free graphs where H2 is H1, the complement of H1. As thes...

A graph is (H1,H2)-free for a pair of graphsH1, H2 if it contains no induced subgraph isomorphic toH1 orH2. In 2001, Král’, Kratochvíl, Tuza, and Woeginger initiated a study into the complexity of Colouring for (H1,H2)free graphs. Since then, others have tried to complete their study, but many cases remain open. We focus on those (H1,H2)-free graphs where H2 is H1, the complement of H1. As thes...