Actions of four organic acids in radix isatidis on endotoxin-neutralization investigated by kinetic turbidimetric assay.

OBJECTIVE: To investigate anti-endotoxin action of four OAs reacted with endotoxin by the LAL assay with KTA. METHODS: Using a incubating kinetic tube reader and kinetic turbidimetric assay (KTA), the concentration-response time curve of endotoxin reacted with limulus amebocyte lysate (LAL) at 37 degrees C were obtained and the action of four organic acids (OAs) on it were investigated. The four OAs were benzoic acid, salicylic acid, syringic acid and 2-amino-benzoic acid from Radix isatidis. Meanwhile, the temperature variation caused by endotoxin with the four OAs was studied by the rabbit pyrogen test (RPT). RESULTS: It was showed that a low concentration (1 mg/mL) of the four OAs had a little effect of anti-endotoxin, and when the concentrations of the four OAs were 30 mg/mL, the endotoxin was neutralized completely. The relationships between the concentrations of endotoxin and the OAs were all linear with correlation coefficients of greater than 0.9995, indicating that the four OAs all had strong anti-endotoxin action, while syringic acid had the strongest action among the four OAs with IC50 of 12.84 mg/mL. CONCLUSION: The investigations of KTA agreed well with the results obtained by means of RPT.

Inferring phylogenetic relationships avoiding forbidden rooted triplets.

To construct a phylogenetic tree or phylogenetic network for describing the evolutionary history of a set of species is a well-studied problem in computational biology. One previously proposed method to infer a phylogenetic tree/network for a large set of species is by merging a collection of known smaller phylogenetic trees on overlapping sets of species so that no (or as little as possible) branching information is lost. However, little work has been done so far on inferring a phylogenetic tree/network from a specified set of trees when in addition, certain evolutionary relationships among the species are known to be highly unlikely. In this paper, we consider the problem of constructing a phylogenetic tree/network which is consistent with all of the rooted triplets in a given set C and none of the rooted triplets in another given set F. Although NP-hard in the general case, we provide some efficient exact and approximation algorithms for a number of biologically meaningful variants of the problem.