Sequence analysis of the cupin gene family in Synechocystis PCC6803

The recently described cupin superfamily of proteins includes the germin and germinlike proteins, of which the cereal oxalate oxidase is the best characterized. This superfamily also includes seed storage proteins, in addition to several microbial enzymes and proteins with unknown function. All these proteins are characterized by the conservation of two central motifs, usually containing two or three histidine residues presumed to be involved with metal binding in the catalytic active site. The present study on the coding regions of Synechocystis PCC6803 identifies a previously unknown group of 12 related cupins, each containing the characteristic two-motif signature. This group comprises 11 single-domain proteins, ranging in length from 104 to 289 residues, and includes two phosphomannose isomerases and two epimerases involved in cell wall synthesis, a member of the pirin group of nuclear proteins, a possible transcriptional regulator, and a close relative-of a cytochrome c551 from Rhodococcus. Additionally, there is a duplicated, two-domain protein that has close similarity to an oxalate decarboxylase from the fungus Collybia velutipes and that is a putative progenitor of the storage proteins of land plants

Adding Isolated Vertices Makes some Online Algorithms Optimal

An unexpected difference between online and offline algorithms is observed. The natural greedy algorithms are shown to be worst case online optimal for Online Independent Set and Online Vertex Cover on graphs with 'enough' isolated vertices, Freckle Graphs. For Online Dominating Set, the greedy algorithm is shown to be worst case online optimal on graphs with at least one isolated vertex. These algorithms are not online optimal in general. The online optimality results for these greedy algorithms imply optimality according to various worst case performance measures, such as the competitive ratio. It is also shown that, despite this worst case optimality, there are Freckle graphs where the greedy independent set algorithm is objectively less good than another algorithm. It is shown that it is NP-hard to determine any of the following for a given graph: the online independence number, the online vertex cover number, and the online domination number.Comment: A footnote in the .tex file didn't show up in the last version. This was fixe

The influence of the moisture content of microcrystalline cellulose on the coating process in a fluidized bed

Overweight and obesity is a health threat of increasing concern and understanding the neurobiology behind obesity is instrumental to the development of effective treatment regimes. Serotonergic neurotransmission is critically involved in eating behaviour; cerebral level of serotonin (5-HT) in animal models is inversely related to food intake and body weight and some effective anti-obesity agents involve blockade of the serotonin transporter (SERT). We investigated in 60 healthy volunteers body mass index (BMI) and regional cerebral SERT binding as measured with [(11)C]DASB PET. In a linear regression model with adjustment for relevant covariates, we found that cortical and subcortical SERT binding was negatively correlated to BMI (-0.003 to -0.012 BP(ND) unit per kg/m(2)). Tobacco smoking and alcohol consumption did not affect cerebral SERT binding. Several effective anti-obesity drugs encompass blockade of the SERT; yet, our study is the first to demonstrate an abnormally decreased cerebral SERT binding in obese individuals. Whether the SERT has a direct role in the regulation of appetite and eating behaviour or whether the finding is due to a compensatory downregulation of SERT secondary to other dysfunction(s) in the serotonergic transmitter system, such as low baseline serotonin levels, remains to be established

Clique covering the edges of a locally cobipartite graph

AbstractWe prove that a locally cobipartite graph on n vertices contains a family of at most n cliques that cover its edges. This is related to Opsut's conjecture that states the competition number of a locally cobipartite graph is at most two