Synthetic Mimic of Antimicrobial Peptide with Nonmembrane-Disrupting Antibacterial Properties

Proteolysis in dairy lactic acid bacteria has been studied in great detail by genetic, biochemical and ultrastructural methods. From these studies the picture emerges that the proteolytic systems of lactococci and lactobacilli are remarkably similar in their components and mode of action. The proteolytic system consists of an extracellularly located serine-proteinase, transport systems specific for di-tripeptides and oligopeptides (> 3 residues), and a multitude of intracellular peptidases. This review describes the properties and regulation of individual components as well as studies that have led to identification of their cellular localization. Targeted mutational techniques developed in recent years have made it possible to investigate the role of individual and combinations of enzymes in vivo. Based on these results as well as in vitro studies of the enzymes and transporters, a model for the proteolytic pathway is proposed. The main features are: (i) proteinases have a broad specificity and are capable of releasing a large number of different oligopeptides, of which a large fraction falls in the range of 4 to 8 amino acid residues; (ii) oligopeptide transport is the main route for nitrogen entry into the cell; (iii) all peptidases are located intracellularly and concerted action of peptidases is required for complete degradation of accumulated peptides.

What makes the arc-preserving subsequence problem hard ? Trans

Abstract. In molecular biology, RNA structure comparison and motif search are of great interest for solving major problems such as phylogeny reconstruction, prediction of molecule folding and identification of common functions. RNA structures can be represented by arc-annotated sequences (primary sequence along with arc annotations), and this paper mainly focuses on the so-called arc-preserving subsequence (APS) problem where, given two arc-annotated sequences (S, P) and (T, Q), we are asking whether (T, Q) can be obtained from (S, P) by deleting some of its bases (together with their incident arcs, if any). In previous studies, this problem has been naturally divided into subproblems reflecting the intrinsic complexity of the arc structures. We show that APS(Crossing, Plain) is NP-complete, thereby answering an open problem posed in [11]. Furthermore, to get more insight into where the actual border between the polynomial and the NP-complete cases lies, we refine the classical subproblems of the APS problem in much the same way as in [19] and prove that both APS({⊏, ≬}, ∅) and APS({<, ≬}, ∅) are NPcomplete. We end this paper by giving some new positive results, namely showing that APS({≬}, ∅) and APS({≬},{≬}) are polynomial time solvable