The local complement G ∗ i of a simple graph G at one of its vertices i is obtained by complementing the subgraph induced by the neighborhood of i and leaving the rest of the graph unchanged. If e = {i, j} is an edge of G then G ∗ e = ((G ∗ i) ∗ j) ∗ i is called the edge-local complement of G along the edge e. We call two graphs edge-locally equivalent if they are related by a sequence of edge-...

Both domains, alpha and beta, of the cytoplasmic membrane-localized Tet proteins encoded by the tet gene family (classes A through E) are required for resistance to tetracycline (Tcr) in gram-negative bacteria. Two inactive proteins, each containing a mutation in the opposite domain, are capable of complementation to produce Tcr. Similarly, inactive hybrid proteins expressed by interdomain gene...

Abstract We study the existence of nontrivial and representable (dual) weak complementations, along with lattice congruences that preserve them, in different constructions bounded lattices, then use this to determine finite weakly complemented lattices largest numbers congruences, structures their congruence lattices. It turns out that, if $$n\ge 7$$ <mml:math xmlns:mml="http://www.w3.org/1998/...

Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its tree to a caterpillar. As a corollary of known theorems, for each k, there is a finite obstruction set Ok of graphs such that a graph G has linear rank-width at most k if and only if no vertex-minor of G is isomorphic to a graph in Ok. However, no attempts have been made to bound the number of gr...

Mutations in 13 genes affecting muscle development in Drosophila have been examined in pairwise combinations for evidence of genetic interactions. Heterozygous combinations of mutations in five genes, including the gene coding for myosin heavy chain, result in more severe phenotypes than respective single heterozygous mutant controls. The various mutant interactions include examples showing all...

Bacterial endosymbionts and their insect hosts establish an intimate metabolic relationship. Bacteria offer a variety of essential nutrients to their hosts, whereas insect cells provide the necessary sources of matter and energy to their tiny metabolic allies. These nutritional complementations sustain themselves on a diversity of metabolite exchanges between the cell host and the reduced yet h...

Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle (2002) proved that binary matroids of bounded branch-width are well-quasi-ordered by the matroid minor relation. We prove another theorem of this kind in terms of rank-width and vertex-minors. For a graph G = (V,E) a...

A novel polyene compound NPP identified in a rare actinomycetes, Pseudonocardia autotrophica KCTC9441, was shown to contain an aglycone identical to nystatin but to harbor a unique di-sugar moiety, mycosaminyl-(α1-4)-N-acetyl-glucosamine, which led to higher solubility and reduced hemolytic activity. Although the nppDI was proved to be responsible for the transfer of first polyene sugar, mycosa...

The tripeptide backbone of phosphinothricin (PT) tripeptide (PTT), a compound with herbicidal activity from Streptomyces viridochromogenes, is assembled by three stand-alone peptide synthetase modules. The enzyme PhsA (66 kDa) recruits the PT-precursor N-acetyl-demethylphosphinothricin (N-Ac-DMPT), whereas the two alanine residues of PTT are assembled by the enzymes PhsB and PhsC (129 and 119 k...

In this paper, we propose a representation of Czech complex predicates with light verbs in a valency lexicon. We demonstrate that if such a representation is to be theoretically adequate and at the same time economical, the information on complex predicates should be divided between two components of the lexicon, a data component and a grammar component. The data component stores all the inform...