Evolutionary history of Dengue virus type 4: Insights into genotype phylodynamics

Dengue virus type 4 (DENV-4) circulates in tropical and subtropical countries from Asia and the Americas. Despite the importance of dengue virus distribution, little is known about the worldwide viral spread. Following a Bayesian phylogenetic approach we inferred the evolutionary history of 310 isolates sampled from 37 countries during the time period 1956-2008 and the spreading dynamics for genotypes I and II. The region (tropical rainforest biome) comprised by Malaysia-Thailand was the most likely ancestral area from which the serotype has originated and spread. Interestingly, cross-correlation analysis on demographic time series with the Asian sequences showed a statistically significant negative correlation that could be suggestive of competition among genotypes within the same serotype. (C) 2011 Elsevier B.V. All rights reserved.

Evolutionary placement of Xanthomonadales based on conserved protein signature sequences

Xanthomonadales comprises one of the largest phytopathogenic bacterial groups, and is currently classified within the gamma-proteobacteria. However, the phylogenetic placement of this group is not clearly resolved, and the results of different studies contradict one another. In this work, the evolutionary position of Xanthomonadales was determined by analyzing the presence of shared insertions and deletions (INDELs) in highly conserved proteins. Several distinctive insertions found in most of the members of the gamma-proteobacteria are absent in Xanthomonadales and groups such as Legionelalles, Chromatiales, Methylococcales, Thiotrichales and Cardiobacteriales. These INDELs were most likely introduced after the branching of Xanthomonadales from most of the gamma-proteobacteria and provide evidence for the phylogenetic placement of the early gamma-proteobacteria. Moreover, other proteins contain insertions exclusive to the Xanthomonadales order, confirming that this is a monophyletic group and provide important specific genetic markers. Thus, the data presented clearly support the Xanthomonadales group as an independent subdivision, and constitute one of the deepest branching lineage within the gamma-proteobacteria clade. (C) 2009 Elsevier Inc. All rights reserved.

Phylogeography and evolutionary history of dengue virus type 3

In this study, we revisited the phylogeography of the three of major DENV-3 genotypes and estimated its rate of evolution, based on the analysis of the envelope (E) gene of 200 strains isolated from 31 different countries around the world over a time period of 50 years (1956-2006). Our phylogenetic analysis revealed a geographical subdivision of DENV-3 population in several country-specific clades. Migration patterns of the main DENV-3 genotypes showed that genotype I was mainly circumspect to the maritime portion of Southeast-Asia and South Pacific, genotype 11 stayed within continental areas in South-East Asia, while genotype III spread across Asia, East Africa and into the Americas. No evidence for rampant co-circulation of distinct genotypes in a single locality was found, suggesting that some factors, other than geographic proximity, may limit the continual dispersion and reintroduction of new DENV-3 variants. Estimates of the evolutionary rate revealed no significant differences among major DENV-3 genotypes. The mean evolutionary rate of DENV-3 in areas with long-term endemic transmissions (i.e., Indonesia and Thailand) was similar to that observed in the Americas, which have been experiencing a more recent dengue spread. We estimated the origin of DENV-3 virus around 1890, and the emergence of current diversity of main DENV-3 genotypes between the middle 1960s and the middle 1970s, coinciding with human population growth, urbanization, and massive human movement, and with the description of the first cases of DENV-3 hemorrhagic fever in Asia. (C) 2008 Elsevier B.V. All rights reserved.

Evolutionary dynamics of the immunodominant repeats of the Plasmodium vivax malaria-vaccine candidate circumsporozoite protein (CSP)

The circumsporozoite protein (CSP) of Plasmodium vivax, a major target for malaria vaccine development, has immunodominant B-cell epitopes mapped to central nonapeptide repeat arrays. To determine whether rearrangements of repeat motifs during mitotic DNA replication of parasites create significant CSP diversity under conditions of low effective meiotic recombination rates, we examined csp alleles from sympatric P. vivax isolates systematically sampled from an area of low malaria endemicity in Brazil over a period of 14 months. Nine unique csp types, comprising six different nona peptide repeats, were observed in 45 isolates analyzed. Identical or nearly identical repeats predominated in most arrays, consistent with their recent expansion. We found strong linkage disequilibrium at sites across the chromosome 8 segment flanking the csp locus, consistent with rare meiotic recombination in this region. We conclude that CSP repeat diversity may not be severely constrained by rare meiotic recombination in areas of low malaria endemicity. New repeat variants may be readily created by nonhomologous recombination even when meiotic recombination is rare, with potential implications for CSP-based vaccine development. (C) 2010 Elsevier B.V. All rights reserved.

Phylogenetic Validation of the Genera Angomonas and Strigomonas of Trypanosomatids Harboring Bacterial Endosymbionts with the Description of New Species of Trypanosomatids and of Proteobacterial Symbionts

We comparatively examined the nutritional, molecular and optical and electron microscopical characteristics of reference species and new isolates of trypanosomatids harboring bacterial endosymbionts. Sequencing of the V7V8 region of the small subunit of the ribosomal RNA (SSU rRNA) gene distinguished six major genotypes among the 13 isolates examined. The entire sequences of the SSU rRNA and glycosomal glyceraldehyde phosphate dehydrogenase (gGAPDH) genes were obtained for phylogenetic analyses. In the resulting phylogenetic trees, the symbiont-harboring species clustered as a major clade comprising two subclades that corresponded to the proposed genera Angomonas and Strigomonas. The genus Angomonas comprised 10 flagellates including former Crithidia deanei and C. desouzai plus a new species. The genus Strigomonas included former Crithidia oncopelti and Blastocrithidia cuiicis plus a new species. Sequences from the internal transcribed spacer of ribosomal DNA (ITS rDNA) and size polymorphism of kinetoplast DNA (kDNA) minicircles revealed considerable genetic heterogeneity within the genera Angomonas and Strigomonas. Phylogenetic analyses based on 16S rDNA and ITS rDNA sequences demonstrated that all of the endosymbionts belonged to the Betaproteobacteria and revealed three new species. The congruence of the phylogenetic trees of trypanosomatids and their symbionts support a co-divergent host-symbiont evolutionary history. (C) 2011 Elsevier GmbH. All rights reserved.

Sequence diversity and evolutionary dynamics of the dimorphic antigen merozoite surface protein-6 and other Msp genes of Plasmodium falciparum

Immune evasion by Plasmodium falciparum is favored by extensive allelic diversity of surface antigens. Some of them, most notably the vaccine-candidate merozoite surface protein (MSP)-1, exhibit a poorly understood pattern of allelic dimorphism, in which all observed alleles group into two highly diverged allelic families with few or no inter-family recombinants. Here we describe contrasting levels and patterns of sequence diversity in genes encoding three MSP-1-associated surface antigens of P. falciparum, ranging from an ancient allelic dimorphism in the Msp-6 gene to a near lack of allelic divergence in Msp-9 to a more classical multi-allele polymorphism in Msp-7 Other members of the Msp-7 gene family exhibit very little polymorphism in non-repetitive regions. A comparison of P. falciparum Msp-6 sequences to an orthologous sequence from P. reichenowi provided evidence for distinct evolutionary histories of the 5` and 3` segments of the dimorphic region in PfMsp-6, consistent with one dimorphic lineage having arisen from recombination between now-extinct ancestral alleles. In addition. we uncovered two surprising patterns of evolution in repetitive sequence. Firsts in Msp-6, large deletions are associated with (nearly) identical sequence motifs at their borders. Second, a comparison of PfMsp-9 with the P. reichenowi ortholog indicated retention of a significant inter-unit diversity within an 18-base pair repeat within the coding region of P. falciparum, but homogenization in P. reichenowi. (C) 2009 Elsevier B.V. All rights reserved.

Oscheius tipulae as an example of eEF1A gene diversity in nematodes

We characterized four eEF1A genes in the alternative rhabditid nematode model organism Oscheius tipulae. This is twice the copy number of eEF1A genes in C. elegans, C. briggsae, and, probably, many other free-living and parasitic nematodes. The introns show features remarkably different from those of other metazoan eEF1A genes. Most of the introns in the eEF1A genes are specific to O. tipulae and are not shared with any of the other genes described in metazoans. Most of the introns are phase 0 (inserted between two codons), and few are inserted in protosplice sites (introns inserted between the nucleotide sequence A/CAG and G/A). Two of these phase 0 introns are conserved in sequence in two or more of the four eEF1A gene copies, and are inserted in the same position in the genes. Neither of these characteristics has been detected in any of the nematode eEF1A genes characterized to date. The coding sequences were also compared with other eEF1A cDNAs from 11 different nematodes to determine the variability of these genes within the phylum Nematoda. Parsimony and distance trees yielded similar topologies, which were similar to those created using other molecular markers. The presence of more than one copy of the eEF1A gene with nearly identical coding regions makes it difficult to define the orthologous cDNAs. As shown by our data on O. tipulae, careful and extensive examination of intron positions in the eEF1A gene across the phylum is necessary to define their potential for use as valid phylogenetic markers.

Evolutionary history of trypanosomes from South American caiman (Caiman yacare) and African crocodiles inferred by phylogenetic analyses using SSU rDNA and gGAPDH genes

In this study, using a combined data set of SSU rDNA and gGAPDH gene sequences, we provide phylogenetic evidence that supports Clustering of crocodilian trypanosomes from the Brazilian Caiman yacare (Alligatoridae) and Trypanosoma grayi, a species that Circulates between African crocodiles (Crocodilydae) and tsetse flies. In a survey of trypanosomes in Caiman yacare from the Brazilian Pantanal, the prevalence of trypanosome infection was 35% as determined by microhaematocrit and haemoculture, and 9 cultures were obtained. The morphology of trypomastigotes from caiman blood and tissue imprints was compared with those described for other crocodilian trypanosomes. Differences in morphology and growth behaviour of caiman trypanosomes were corroborated by molecular polymorphism that revealed 2 genotypes. Eight isolates were ascribed to genotype Cay01 and 1 to genotype Cay02. Phylogenetic inferences based on concatenated SSU rDNA and gGAPDII sequences showed that caiman isolates are closely related to T. grayi, constituting a well-supported monophyletic assemblage (clade T. grayi). Divergence time estimates based on clade composition, and biogeographical and geological events were used to discuss the relationships between the evolutionary histories of crocodilian trypanosomes and their hosts.

Efficiency issues of evolutionary k-means

One of the top ten most influential data mining algorithms, k-means, is known for being simple and scalable. However, it is sensitive to initialization of prototypes and requires that the number of clusters be specified in advance. This paper shows that evolutionary techniques conceived to guide the application of k-means can be more computationally efficient than systematic (i.e., repetitive) approaches that try to get around the above-mentioned drawbacks by repeatedly running the algorithm from different configurations for the number of clusters and initial positions of prototypes. To do so, a modified version of a (k-means based) fast evolutionary algorithm for clustering is employed. Theoretical complexity analyses for the systematic and evolutionary algorithms under interest are provided. Computational experiments and statistical analyses of the results are presented for artificial and text mining data sets. (C) 2010 Elsevier B.V. All rights reserved.

Evolutionary fuzzy clustering of relational data

This paper is concerned with the computational efficiency of fuzzy clustering algorithms when the data set to be clustered is described by a proximity matrix only (relational data) and the number of clusters must be automatically estimated from such data. A fuzzy variant of an evolutionary algorithm for relational clustering is derived and compared against two systematic (pseudo-exhaustive) approaches that can also be used to automatically estimate the number of fuzzy clusters in relational data. An extensive collection of experiments involving 18 artificial and two real data sets is reported and analyzed. (C) 2011 Elsevier B.V. All rights reserved.

On the efficiency of evolutionary fuzzy clustering

This paper tackles the problem of showing that evolutionary algorithms for fuzzy clustering can be more efficient than systematic (i.e. repetitive) approaches when the number of clusters in a data set is unknown. To do so, a fuzzy version of an Evolutionary Algorithm for Clustering (EAC) is introduced. A fuzzy cluster validity criterion and a fuzzy local search algorithm are used instead of their hard counterparts employed by EAC. Theoretical complexity analyses for both the systematic and evolutionary algorithms under interest are provided. Examples with computational experiments and statistical analyses are also presented.

Evolutionary tuning of SVM parameter values in multiclass problems

Support vector machines (SVMs) were originally formulated for the solution of binary classification problems. In multiclass problems, a decomposition approach is often employed, in which the multiclass problem is divided into multiple binary subproblems, whose results are combined. Generally, the performance of SVM classifiers is affected by the selection of values for their parameters. This paper investigates the use of genetic algorithms (GAs) to tune the parameters of the binary SVMs in common multiclass decompositions. The developed GA may search for a set of parameter values common to all binary classifiers or for differentiated values for each binary classifier. (C) 2008 Elsevier B.V. All rights reserved.

A hybrid approach to learn with imbalanced classes using evolutionary algorithms

There is an increasing interest in the application of Evolutionary Algorithms (EAs) to induce classification rules. This hybrid approach can benefit areas where classical methods for rule induction have not been very successful. One example is the induction of classification rules in imbalanced domains. Imbalanced data occur when one or more classes heavily outnumber other classes. Frequently, classical machine learning (ML) classifiers are not able to learn in the presence of imbalanced data sets, inducing classification models that always predict the most numerous classes. In this work, we propose a novel hybrid approach to deal with this problem. We create several balanced data sets with all minority class cases and a random sample of majority class cases. These balanced data sets are fed to classical ML systems that produce rule sets. The rule sets are combined creating a pool of rules and an EA is used to build a classifier from this pool of rules. This hybrid approach has some advantages over undersampling, since it reduces the amount of discarded information, and some advantages over oversampling, since it avoids overfitting. The proposed approach was experimentally analysed and the experimental results show an improvement in the classification performance measured as the area under the receiver operating characteristics (ROC) curve.

Fiedler trees for multiscale surface analysis

In this work we introduce a new hierarchical surface decomposition method for multiscale analysis of surface meshes. In contrast to other multiresolution methods, our approach relies on spectral properties of the surface to build a binary hierarchical decomposition. Namely, we utilize the first nontrivial eigenfunction of the Laplace-Beltrami operator to recursively decompose the surface. For this reason we coin our surface decomposition the Fiedler tree. Using the Fiedler tree ensures a number of attractive properties, including: mesh-independent decomposition, well-formed and nearly equi-areal surface patches, and noise robustness. We show how the evenly distributed patches can be exploited for generating multiresolution high quality uniform meshes. Additionally, our decomposition permits a natural means for carrying out wavelet methods, resulting in an intuitive method for producing feature-sensitive meshes at multiple scales. Published by Elsevier Ltd.

Border trees of complex networks

The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small-world properties of real networks were fundamental to stimulate more realistic models and to understand important dynamical processes related to network growth. However, the properties of the network borders (nodes with degree equal to 1), one of its most fragile parts, remained little investigated and understood. The border nodes may be involved in the evolution of structures such as geographical networks. Here we analyze the border trees of complex networks, which are defined as the subgraphs without cycles connected to the remainder of the network (containing cycles) and terminating into border nodes. In addition to describing an algorithm for identification of such tree subgraphs, we also consider how their topological properties can be quantified in terms of their depth and number of leaves. We investigate the properties of border trees for several theoretical models as well as real-world networks. Among the obtained results, we found that more than half of the nodes of some real-world networks belong to the border trees. A power-law with cut-off was observed for the distribution of the depth and number of leaves of the border trees. An analysis of the local role of the nodes in the border trees was also performed.