A phylogenetic study of hepatitis B virus in chronically infected Brazilian patients of Western and Asian descent

Hepatitis B virus (HBV) causes one of the most important chronic viral infections worldwide. HBV is classified into eight genotypes whose epidemiology varies geographically. In Brazil, genotypes A, D, and F are more frequent, while in East Asia, genotypes B and C predominate. Several studies showed that immigrants retain the HBV infection pattern of their ancestral country. To identify HBV genotypes infecting chronic carriers in Brazilian families of Western and Asian descent by Hepatitis B surface antigen gene sequencing and analyze the route of viral transmission by phylogenetic analysis of viral sequences. Eighty-seven people chronically infected with HBV were separated into two groups: Western descent (27) and Asian descent (60). Surface and pre-core/core genes were amplified from serum HBV-DNA and sequences were subjected to phylogenetic analysis. HBV genotype A was found in 74% of Western subjects, while genotype C was found in 94% of Asian patients. Thirty-eight percent of Western families were infected with HBV with similar pre-core/core sequences, while only 25% of Asian families showed similarity in these sequences. Phylogenetical analysis of pre-core/core HBV gene suggested intra-familial transmission of HBV in 38% of Western families and 25% of Asian families. Analysis of HBsAg gene sequences helped to define the HBV genotype but did not allow inferring route of transmission as its sequences showed a smaller phylogenetic signal than pre-core/core sequences. Chronic HBV carriers of Asian descent born in or living in Brazil were infected with the same HBV genotype predominant in their ancestral country.

Genetic algorithms for continuous optimization problems - a concept of parameter-space size adjustment

The concept of parameter-space size adjustment is pn,posed in order to enable successful application of genetic algorithms to continuous optimization problems. Performance of genetic algorithms with six different combinations of selection and reproduction mechanisms, with and without parameter-space size adjustment, were severely tested on eleven multiminima test functions. An algorithm with the best performance was employed for the determination of the model parameters of the optical constants of Pt, Ni and Cr.

Concurreny based transition refinement for the verification of distributed algorithms

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.

Robust parameter settings of evolutionary algorithms for the optimisation of agricultural systems models

Numerical optimisation methods are being more commonly applied to agricultural systems models, to identify the most profitable management strategies. The available optimisation algorithms are reviewed and compared, with literature and our studies identifying evolutionary algorithms (including genetic algorithms) as superior in this regard to simulated annealing, tabu search, hill-climbing, and direct-search methods. Results of a complex beef property optimisation, using a real-value genetic algorithm, are presented. The relative contributions of the range of operational options and parameters of this method are discussed, and general recommendations listed to assist practitioners applying evolutionary algorithms to the solution of agricultural systems. (C) 2001 Elsevier Science Ltd. All rights reserved.

Testing the link between the latitudinal gradient in species richness and rates of molecular evolution

Numerous hypotheses have been proposed to explain latitudinal gradients in species richness, but all are subject to ongoing debate. Here we examine Rohde's (1978, 1992) hypothesis, which proposes that climatic conditions at low latitudes lead to elevated rates of speciation. This hypothesis predicts that rates of molecular evolution should increase towards lower latitudes, but this prediction has never been tested. We discuss potential links between rates of molecular evolution and latitudinal diversity gradients, and present the first test of latitudinal variation in rates of molecular evolution. Using 45 phylogenetically independent, latitudinally separated pairs of bird species and higher taxa, we compare rates of evolution of two mitochondrial genes and DNA-DNA hybridization distances. We find no support for an effect of latitude on rate of molecular evolution. This result casts doubt on the generality of a key component of Rohde's hypothesis linking climate and speciation.

Using siting algorithms in the design of marine reserve networks

Using benthic habitat data from the Florida Keys (USA), we demonstrate how siting algorithms can help identify potential networks of marine reserves that comprehensively represent target habitat types. We applied a flexible optimization tool-simulated annealing-to represent a fixed proportion of different marine habitat types within a geographic area. We investigated the relative influence of spatial information, planning-unit size, detail of habitat classification, and magnitude of the overall conservation goal on the resulting network scenarios. With this method, we were able to identify many adequate reserve systems that met the conservation goals, e.g., representing at least 20% of each conservation target (i.e., habitat type) while fulfilling the overall aim of minimizing the system area and perimeter. One of the most useful types of information provided by this siting algorithm comes from an irreplaceability analysis, which is a count of the number of, times unique planning units were included in reserve system scenarios. This analysis indicated that many different combinations of sites produced networks that met the conservation goals. While individual 1-km(2) areas were fairly interchangeable, the irreplaceability analysis highlighted larger areas within the planning region that were chosen consistently to meet the goals incorporated into the algorithm. Additionally, we found that reserve systems designed with a high degree of spatial clustering tended to have considerably less perimeter and larger overall areas in reserve-a configuration that may be preferable particularly for sociopolitical reasons. This exercise illustrates the value of using the simulated annealing algorithm to help site marine reserves: the approach makes efficient use of;available resources, can be used interactively by conservation decision makers, and offers biologically suitable alternative networks from which an effective system of marine reserves can be crafted.

Fast, scalable master equation solution algorithms. IV. Lanczos iteration with diffusion approximation preconditioned iterative inversion

In this paper we propose a second linearly scalable method for solving large master equations arising in the context of gas-phase reactive systems. The new method is based on the well-known shift-invert Lanczos iteration using the GMRES iteration preconditioned using the diffusion approximation to the master equation to provide the inverse of the master equation matrix. In this way we avoid the cubic scaling of traditional master equation solution methods while maintaining the speed of a partial spectral decomposition. The method is tested using a master equation modeling the formation of propargyl from the reaction of singlet methylene with acetylene, proceeding through long-lived isomerizing intermediates. (C) 2003 American Institute of Physics.

Fast, scalable master equation solution algorithms. III. Direct time propagation accelerated by a diffusion approximation preconditioned iterative solver

In this paper we propose a novel fast and linearly scalable method for solving master equations arising in the context of gas-phase reactive systems, based on an existent stiff ordinary differential equation integrator. The required solution of a linear system involving the Jacobian matrix is achieved using the GMRES iteration preconditioned using the diffusion approximation to the master equation. In this way we avoid the cubic scaling of traditional master equation solution methods and maintain the low temperature robustness of numerical integration. The method is tested using a master equation modelling the formation of propargyl from the reaction of singlet methylene with acetylene, proceeding through long lived isomerizing intermediates. (C) 2003 American Institute of Physics.

Knowledge-based system on optimum design of liquid retaining structures with genetic algorithms

This paper delineates the development of a prototype hybrid knowledge-based system for the optimum design of liquid retaining structures by coupling the blackboard architecture, an expert system shell VISUAL RULE STUDIO and genetic algorithm (GA). Through custom-built interactive graphical user interfaces under a user-friendly environment, the user is directed throughout the design process, which includes preliminary design, load specification, model generation, finite element analysis, code compliance checking, and member sizing optimization. For structural optimization, GA is applied to the minimum cost design of structural systems with discrete reinforced concrete sections. The design of a typical example of the liquid retaining structure is illustrated. The results demonstrate extraordinarily converging speed as near-optimal solutions are acquired after merely exploration of a small portion of the search space. This system can act as a consultant to assist novice designers in the design of liquid retaining structures.