Escherichia coli LR05, in addition to producing MccB17, J25, and D93, secretes microcin L, a newly discovered microcin that exhibits strong antibacterial activity against related Enterobacteriaceae, including Salmonella enterica serovars Typhimurium and Enteritidis. Microcin L was purified using a two-step procedure including solid-phase extraction and reverse-phase C(18) high-performance liqui...

Most of the live vaccine doses of vaccinia virus donated to the Intensified Smallpox Eradication Programme after 1971 were prepared using the L-IVP strain. A mixture of three clones of the L-IVP strain was sequenced using MySEQ. Consensus sequence similarity with the vaccinia virus Lister strain is 99.5%.

Received ; accepted – 2 – ABSTRACT Linearly polarized, non-masing, rotational lines have been detected for the first time in the interstellar medium. This effect occurs in molecular clouds with a magnetic field, and traces the field direction, offering an alternative technique to dust emission polarimetry. The line polarization mechanism is similar to that in masers, but with lower degrees of p...

In this paper the computational complexity of the (bi)simulation problem over restricted graph classes is studied. For trees given as pointer structures or terms the (bi)simulation problem is complete for logarithmic space or NC1, respectively. This solves an open problem from Balcázar, Gabarró, and Sántha. We also show that the simulation problem is P-complete even for graphs of bounded path-w...

We investigate the complexity of the model checking problem for propositional intuitionistic logic. We show that the model checking problem for intuitionistic logic with one variable is complete for logspace-uniform AC1, and for intuitionistic logic with two variables it is P-complete. For superintuitionistic logics with one variable, we obtain NC1-completeness for the model checking problem an...

We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as number restrictions in description logics. We show that EML satisfiability is only pspace-complete by designing a Ladner-like algorithm. This extends a well-known and non-trivial pspace upper bound for graded modal logic...

The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (i.e., language inclusion) is ptime-hard, even for finite acyclic labelled transition systems. This reproves and substantially extends the result of Balcázar, Gabarró and Sántha (1992) for bisimilarity.

Proof equivalence in a logic is the problem of deciding whether two proofs are equivalent modulo a set of permutation of rules that reflects the commutative conversions of its cut-elimination procedure. As such, it is related to the question of proofnets: finding canonical representatives of equivalence classes of proofs that have good computational properties. It can also be seen as the word p...

based on a complete heyting algebra l, the relations between lfuzzifyingconvergence spaces and l-fuzzifying topological spaces are studied.it is shown that, as a reflective subcategory, the category of l-fuzzifying topologicalspaces could be embedded in the category of l-fuzzifying convergencespaces and the latter is cartesian closed. also the specialization l-preorderof l-fuzzifying convergenc...