Phuong Tu Nguyen

Soil nematodes play an important role in indication for assessing soil environments and ecosystems. Previous studies of nematode community analyses based on molecular identification have shown to be useful for assessing soil environments. Here we applied PCR-DGGE method for molecular analysis of five soil nematode communities collected from four provinces in Southeastern Vietnam based on SSU gene. By sequencing DNA bands derived from S5 community sample, our data show 15 species containing soil nematode, other nematode and non-nematode species. Genus Meloidogyne was found as abundant one. The genetic relationship of soil nematode species in S5 community were determined by Maximum Likelihood tree re-construction based on SSU gene. This molecular approach is applied for the first time in Vietnam for identification of soil nematode communities.

A number of theories have been developed to characterize ALogTime (or uniform NC 1, or just NC 1), the class of languages accepted by alternating logtime Turing machines, in the same way that Buss’s theory ${{\bf S}^{1}_{2}}$ characterizes polytime functions. Among these, ALV′ (by Clote) is particularly interesting because it is developed based on Barrington’s theorem that the word problem for the permutation group S 5 is complete for ALogTime. On the other hand, ALV (by Clote), T 0 NC 0 (by Clote and Takeuti) as well as Arai’s theory ${{\bf AID}+\Sigma_0^B{-}{\bf CA}}$ and its two-sorted version VNC 1 (by Cook and Morioka) are based on the circuit characterization of ALogTime. While the last three theories have been known to be equivalent, their relationship to ALV′ has been an open problem. Here we show that ALV′ is indeed equivalent to the other theories

We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in , it characterizes the consequences of and that natural restrictions of it characterize the consequences of and of the bounded arithmetic hierarchy. We also show that over V0 it characterizes the consequences of V1 and hence that, in some sense, a miniaturized version of the principle gives a new characterization of the consequences of . Throughout our search problems are “type-2” NP search problems, which take second-order objects as parameters