In this work, we have purified the His-tagged oxygenase (ht-oxygenase) component of Rhodococcus globerulus P6 biphenyl dioxygenase. The alpha or beta subunit of P6 oxygenase was exchanged with the corresponding subunit of Pseudomonas sp. strain LB400 or of Comamonas testosteroni B-356 to create new chimeras that were purified ht-proteins and designated ht-alpha(P6)beta(P6), ht-alpha(P6)beta(LB4...

P6 is an outer membrane protein of Haemophilus influenzae that is antigenically conserved and considered a candidate component of future H. influenzae vaccines. P6 contains a surface-exposed epitope recognized by monoclonal antibody (MAb) 3B9. This epitope has been shown to be distinct from that recognized by the P6-specific MAbs 7F3 and 4G4 in a competitive inhibition enzyme-linked immunosorbe...

HIV-1 protease (PR) is encoded by pol, which is initially translated as a Pr160gag-pol polyprotein by a ribosomal frameshift event. Within Gag-Pol, truncated p6gag is replaced by a transframe domain (referred to as p6* or p6pol) located directly upstream of PR. p6* has been proposed as playing a role in modulating PR activation. Overlapping reading frames between p6* and p6gag present a challen...

Seventeen non-directed td- (thymidylate synthase-deficient) splicing-defective mutations isolated in phage T4 were localized within the catalytic core of the ribozyme. All of the mutations occur in conserved structural elements that form part of the td intron core secondary structure. Remarkably, seven of the seventeen independently isolated mutations clustered in the dinucleotide 5' element (P...

Outer membrane protein P6 is the subject of investigation as a vaccine antigen to prevent infections caused by nontypeable Haemophilus influenzae, which causes otitis media in children and respiratory tract infections in adults with chronic lung disease. P6 induces protective immune responses in animal models and is the target of potentially protective immune responses in humans. P6 is a 16-kDa...

Let G be a finite undirected graph. A vertex dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d. in G, is known to be NP-complete even for very restricted graph classes such as P7-free chordal gr...