Spontaneous bacterial cell lysis and biofilm formation in the colon of the Cape Dune mole-rat and the laboratory rabbit

A wide range of techniques, including high-throughput DNA sequencing methods, have been applied to the evaluation of the normal intestinal flora. However, the inability to grow many of those species in culture imposes substantial constraints on the techniques used to evaluate this important community. The presence of biofilms in the normal gut adds further complexity to the issue. In this study, a flow cytometric analysis was used to separate intact bacterial cells, cell debris, and other particulate matter based on bacteria-specific staining and particle size. In addition, an analysis of biofilm formation using fluorescent light microscopy was conducted. Using these approaches, the ratio of bacterial cell debris to intact bacterial cells as a measure of spontaneous lysis of bacterial cells in the gut of the Cape dune mole-rat (Bathyergus suillus) and the laboratory rabbit (Oryctolagus cuniculus) was examined, and the degree of biofilm formation was semi-quantitatively assessed. The results suggest that the degree of spontaneous cell lysis was greater in the appendix than in the cecum in both the mole-rat and the rabbit. Further, the results point toward extensive epithelial-associated biofilm formation in the proximal mole-rat and rabbit large bowel, although the biofilms may be less structured than those found in laboratory rodents and in humans. © 2011 Springer-Verlag.Articl

The computational complexity of disconnected cut and 2K2-partition.

For a connected graph G = (V,E), a subset U ⊆ V is called a disconnected cut if U disconnects the graph and the subgraph induced by U is disconnected as well. We show that the problem to test whether a graph has a disconnected cut is NP-complete. This problem is polynomially equivalent to the following problems: testing if a graph has a 2K 2-partition, testing if a graph allows a vertex-surjective homomorphism to the reflexive 4-cycle and testing if a graph has a spanning subgraph that consists of at most two bicliques. Hence, as an immediate consequence, these three decision problems are NP-complete as well. This settles an open problem frequently posed in each of the four settings

Vesicles-on-a-chip: A universal microfluidic platform for the assembly of liposomes and polymersomes

In this study, we present a PDMS-based microfluidic platform for the fabrication of both liposomes and polymersomes. Based on a double-emulsion template formed in flow-focusing configuration, monodisperse liposomes and polymersomes are produced in a controlled manner after solvent extraction. Both types of vesicles can be formed from the exact same combination of fluids and are stable for at least three months under ambient storage conditions. By tuning the flow rates of the different fluid phases in the flow-focusing microfluidic design, the size of the liposomes and polymersomes can be varied over atleast one order of magnitude. This method offers a versatile tool for future studies, e.g., involving the encapsulation of biological agents and the functionalization of artificial cell membranes, and might also be applicable for the controlled fabrication of hybrid vesicles

Finding induced paths of given parity in claw-free graphs

The Parity Path problem is to decide if a given graph contains both an induced path of odd length and an induced path of even length between two specified vertices. In the related problems Odd Induced Path and Even Induced Path, the goal is to determine whether an induced path of odd, respectively even, length between two specified vertices exists. Although all three problems are NP-complete in general, we show that they can be solved in O(n5)(n5) time for the class of claw-free graphs. Two vertices s and t form an even pair in G if every induced path from s to t in G has even length. Our results imply that the problem of deciding if two specified vertices of a claw-free graph form an even pair, as well as the problem of deciding if a given claw-free graph has an even pair, can be solved in O(n5)(n5) time and O(n7)(n7) time, respectively. We also show that we can decide in O(n7)(n7) time whether a claw-free graph has an induced cycle of given parity through a specified vertex. Finally, we show that a shortest induced path of given parity between two specified vertices of a claw-free perfect graph can be found in O(n7)(n7) time