Pretreatment of Highly Polluted Pharmaceutical Waste Broth by Wet Air Oxidation

The preoxidation of a highly polluted waste pharmaceutical fermentation broth using wet air oxidation (WAO) has been studied as a possible method for the effective removal of organics. The applied (pre)treatment method should enhance the biotreatability of the pharmaceutical fermentation broth in terms of reduced initial toxicity and higher biodegradability. Preliminary experiments in the pilot biological treatment plant were successful only at low organic loads, whereas the system collapses at higher ones. The characterization of the fermentation broth was started by common physicochemical analysis, whereas several bioassays were used to determine its impact on biological treatment plants and the environment. Toxicity prior to and after WAO was determined using the acute Vibrio fischeri test, measurement of inhibition of O2 consumption, and the Daphnia magna acute test. Ready biodegradability of the treated and untreated broth has also been assessed. WAO experiments were accomplished in the 2?L batch reactor at different temperatures (240/280°C) and operating pressures. WAO experiments confirmed reduction of the toxicity toward microorganisms, whereas oxidized wastewater was more toxic to daphnids. Biodegradability of the oxidized broth has also been enhanced. Further work has been focused on designing appropriate combination of WAO and biological processes.     

Gastrointestinal autonomic nerve tumour presenting as small bowel volvulus: a rare disease with a rare presentation

A 78-year-old Chinese woman presented with recurrent postprandial abdominal pain. Computerised tomography revealed a small bowel tumour causing volvulus of a segment of the small bowel. Laparotomy confirmed an extraluminal ileal tumour with partial volvulus of the involved small bowel segment. Small bowel resection was done. Histological and ultrastructural studies confirmed a gastrointestinal autonomic nerve tumour. We review the medical literature on this rare tumour.     

Longitudinal bone mineral density changes in early rheumatoid arthritis

A prospective longitudinal study of patients with early RA was performed to examine the influence of disease duration, disease activity and physical activity on bone loss. Sixty-seven patients with non-steroid treated RA of less than 5 yr duration, including 16 patients with disease duration less than 6 months, had BMD measurements of the femoral neck and the lumbar spine over a 12-month period using dual energy X-ray absorptiometry. The BMD changes were compared with values from 72 control patients and were also correlated with serial measurements of disease activity (measured by the Stoke Index) and disability [measured by the Health Assessment Questionnaire (HAQ) score], at 3-monthly intervals over the 12-month period. No significant differences in BMD changes were found between RA patients and controls overall. Patients with disease duration of less than 6 months had significantly greater loss of BMD at the femoral neck (-3.9%, S.E.M. 1.5) than the remainder of the cohort (-0.2%, S.E.M. 0.7) (P = 0.02) and controls (-0.8%, S.E.M. 0.6). Lumbar spine BMD changes correlated with the initial Stoke Index (Rs-0.373, P = 0.01) but not mean Stoke Indices. There was no correlation of BMD changes with age or HAQ scores. These findings suggest that significant bone loss occurs within the first few months of disease in patients with RA.     

A genetic algorithm for multiple molecular sequence alignment

MOTIVATION: Multiple molecular sequence alignment is among the most important and most challenging tasks in computational biology. The currently used alignment techniques are characterized by great computational complexity, which prevents their wider use. This research is aimed at developing a new technique for efficient multiple sequence alignment. APPROACH: The new method is based on genetic algorithms. Genetic algorithms are stochastic approaches for efficient and robust searching. By converting biomolecular sequence alignment into a problem of searching for optimal or near-optimal points in an 'alignment space', a genetic algorithm can be used to find good alignments very efficiently. RESULTS: Experiments on real data sets have shown that the average computing time of this technique may be two or three orders lower than that of a technique based on pairwise dynamic programming, while the alignment qualities are very similar. AVAILABILITY: A C program on UNIX has been written to implement the technique. It is available on request from the authors.