A graph G is well-covered if every maximal independent set of maximum. (k,ℓ)-partition a partition its vertex into k sets and ℓ cliques. (k,ℓ)-well-covered it admits (k,ℓ)-partition. The recognition graphs polynomial-time solvable for the cases (0,1), (0,2), (1,0), (1,1), (1,2), (2,0), hard, otherwise. In sandwich problem property Π, we are given pair G1=(V,E1) G2=(V,E2) with E1⊆E2, asked wheth...

We have found that the replicative helicase E1 of bovine papillomavirus type 1 (BPV-1) interacts with a key cell cycle regulator of S phase, the cyclin E-Cdk2 kinase. The E1 helicase, which interacts with cyclin E and not with Cdk2, presents the highest affinity for catalytically active kinase complexes. In addition, E1, cyclin E, and Cdk2 expressed in Xenopus egg extracts are quantitatively co...

This is a short note inspired by some ideas and results from [3,6–8]. It is about Parsing Expression Grammars (PEGs) introduced by Ford in [1]. PEG specifies a language by defining for it a parser with limited backtracking. All of the quoted papers contain a detailed introduction to PEG, so it is not repeated here. Backtracking means that if e1 in a choice expression e1/e2 fails, the parser ret...

Let R be a commutative ring and M and N be R-modules. (We always work with rings having a multiplicative identity and modules are assumed to be unital: 1 ·m = m for all m ∈M .) The direct sum M ⊕N is an addition operation on modules. We introduce here a product operation M ⊗RN , called the tensor product. We will start off by describing what a tensor product of modules is supposed to look like....

Let G be a connected graph and g non-negative integer. A vertex set S of is called g-extra cut if G−S disconnected each component has at least g+1 vertices. The connectivity the minimum cardinality one cut. For two graphs G1=(V1,E1) G2=(V2,E2), strong product G1⊠G2 defined as follows: its V1×V2 edge {(x1,x2)(y1,y2)|x1=x2 y1y2∈E2; or y1=y2 x1x2∈E1; x1x2∈E1 y1y2∈E2}, where (x1,x2),(y1,y2)∈V1×V2. ...

Dysregulation of estrogen related pathways is implicated colorectal cancer (CRC) development. However, significance of intratissue concentration of estrone (E1) and 17β-estradiol (E2) in relation to estrogen receptor (ESR) expression level was not addressed so far. Herein, we measured E1 and E2 intratissue concentration using liquid chromatography electrospray ionization tandem mass spectrometr...

Rubella virus (RV) envelope glycoproteins E1 and E2 are targeted to the Golgi as heterodimers. While E2 contains a transmembrane Golgi retention signal, E1 is arrested in a pre-Golgi compartment in the absence of E2, and appears to require heterodimerization in order to reach the Golgi. Various forms of E1 with deletions in the ectodomain or lacking the cytoplasmic (CT) and transmembrane (TM) d...

We detected an antibody to HCV envelope protein (E1) in sera of patients with HCV-related chronic liver diseases (20 patients with chronic hepatitis and 5 patients with liver cirrhosis) by Western blotting using the fusion protein of E1 envelope protein and beta-galactosidase as an antigen. The antibody to HCV E1 (anti-HCV E1) was detected in 8 (42%) of 19 patients positive for HCV-RNA (16 were...

Given an elliptic curve E1 over a number field K and an element s in its 2-Selmer group, we give two different ways to construct infinitely many Abelian surfaces A such that the homogeneous space representing s occurs as a fibre of A over another elliptic curve E2. We show that by comparing the 2Selmer groups of E1, E2 and A, we can obtain information about X(E1/K)[2] and we give examples where...

The alphavirus Semliki Forest virus (SFV) matures by budding at the cell surface. This process is driven by interactions of its membrane protein heterodimer E2-E1 and the nucleocapsid. The virus penetrates into new cells by an E1-mediated membrane fusion event. The E1 subunit has a short, strongly positively charged cytoplasmic tail peptide (Arg-Arg) which is very conserved among different alph...