Tyrosinase, a key copper-containing enzyme involved in melanin biosynthesis, is closely associated with hyperpigmentation disorders, cancer, and neurodegenerative diseases, and as such, it is an essential target in medicine and cosmetics. Known tyrosinase inhibitors possess adverse side effects, and there are no safety regulations; therefore, it is necessary to develop new inhibitors with fewer...

The multifunctional large (L) polymerase protein of vesicular stomatitis virus (VSV) contains enzymatic activities essential for RNA synthesis, including mRNA cap addition and polyadenylation. We previously mapped amino acid residues G1154, T1157, H1227, and R1228, present within conserved region V (CRV) of L, as essential for mRNA cap addition. Here we show that alanine substitutions to these ...

Tyrosinase, a key copper-containing enzyme involved in melanin biosynthesis, is closely associated with hyperpigmentation disorders, cancer, and neurodegenerative diseases, and as such, it is an essential target in medicine and cosmetics. Known tyrosinase inhibitors possess adverse side effects, and there are no safety regulations; therefore, it is necessary to develop new inhibitors with fewer...

Hexavalent chromium (CrVI) is a heavy metal widely used in more than 50 industries. Nephrotoxicity is a major adverse effect of chromium poisoning. The present study investigated the potential renoprotective effect of lactoferrin (Lf) against potassium dichromate (PDC)-induced acute kidney injury (AKI) in rats. Beside, because previous studies suggest that interlukin-18 (IL-18) and insulin-like...

A bacterial consortium that can degrade chloroand nitrophenols has been isolated from the rhizosphere of Phragmitis communis. Degradation of 4-chlorophenol (4-CP) by a consortium attached to granular activated carbon (GAC) in a bio®lm reactor was evaluated during both open and closed modes of operation. During the operation of the bio®lm reactor, 4-CP was not detected in the column e‚uent, bein...

The problems of nding a longest common subsequence and a shortest common supersequence of a set of strings are well-known. They can be solved in polynomial time for two strings (in fact the problems are dual in this case), or for any xed number of strings, by dynamic programming. But both problems are NP-hard in general for an arbitrary number k of strings. Here we study the related problems of...