54 research outputs found

    A network perspective on the topological importance of enzymes and their phylogenetic conservation

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>A metabolic network is the sum of all chemical transformations or reactions in the cell, with the metabolites being interconnected by enzyme-catalyzed reactions. Many enzymes exist in numerous species while others occur only in a few. We ask if there are relationships between the phylogenetic profile of an enzyme, or the number of different bacterial species that contain it, and its topological importance in the metabolic network. Our null hypothesis is that phylogenetic profile is independent of topological importance. To test our null hypothesis we constructed an enzyme network from the KEGG (Kyoto Encyclopedia of Genes and Genomes) database. We calculated three network indices of topological importance: the degree or the number of connections of a network node; closeness centrality, which measures how close a node is to others; and betweenness centrality measuring how frequently a node appears on all shortest paths between two other nodes.</p> <p>Results</p> <p>Enzyme phylogenetic profile correlates best with betweenness centrality and also quite closely with degree, but poorly with closeness centrality. Both betweenness and closeness centralities are non-local measures of topological importance and it is intriguing that they have contrasting power of predicting phylogenetic profile in bacterial species. We speculate that redundancy in an enzyme network may be reflected by betweenness centrality but not by closeness centrality. We also discuss factors influencing the correlation between phylogenetic profile and topological importance.</p> <p>Conclusion</p> <p>Our analysis falsifies the hypothesis that phylogenetic profile of enzymes is independent of enzyme network importance. Our results show that phylogenetic profile correlates better with degree and betweenness centrality, but less so with closeness centrality. Enzymes that occur in many bacterial species tend to be those that have high network importance. We speculate that this phenomenon originates in mechanisms driving network evolution. Closeness centrality reflects phylogenetic profile poorly. This is because metabolic networks often consist of distinct functional modules and some are not in the centre of the network. Enzymes in these peripheral parts of a network might be important for cell survival and should therefore occur in many bacterial species. They are, however, distant from other enzymes in the same network.</p

    R5 Clade C SHIV Strains with Tier 1 or 2 Neutralization Sensitivity: Tools to Dissect Env Evolution and to Develop AIDS Vaccines in Primate Models

    Get PDF
    Background: HIV-1 clade C (HIV-C) predominates worldwide, and anti-HIV-C vaccines are urgently needed. Neutralizing antibody (nAb) responses are considered important but have proved difficult to elicit. Although some current immunogens elicit antibodies that neutralize highly neutralization-sensitive (tier 1) HIV strains, most circulating HIVs exhibiting a less sensitive (tier 2) phenotype are not neutralized. Thus, both tier 1 and 2 viruses are needed for vaccine discovery in nonhuman primate models. Methodology/Principal Findings: We constructed a tier 1 simian-human immunodeficiency virus, SHIV-1157ipEL, by inserting an “early,” recently transmitted HIV-C env into the SHIV-1157ipd3N4 backbone [1] encoding a “late” form of the same env, which had evolved in a SHIV-infected rhesus monkey (RM) with AIDS. SHIV-1157ipEL was rapidly passaged to yield SHIV-1157ipEL-p, which remained exclusively R5-tropic and had a tier 1 phenotype, in contrast to “late” SHIV-1157ipd3N4 (tier 2). After 5 weekly low-dose intrarectal exposures, SHIV-1157ipEL-p systemically infected 16 out of 17 RM with high peak viral RNA loads and depleted gut CD4+^+ T cells. SHIV-1157ipEL-p and SHIV-1157ipd3N4 env genes diverge mostly in V1/V2. Molecular modeling revealed a possible mechanism for the increased neutralization resistance of SHIV-1157ipd3N4 Env: V2 loops hindering access to the CD4 binding site, shown experimentally with nAb b12. Similar mutations have been linked to decreased neutralization sensitivity in HIV-C strains isolated from humans over time, indicating parallel HIV-C Env evolution in humans and RM. Conclusions/Significance: SHIV-1157ipEL-p, the first tier 1 R5 clade C SHIV, and SHIV-1157ipd3N4, its tier 2 counterpart, represent biologically relevant tools for anti-HIV-C vaccine development in primates

    Juvenile Greylag Geese (Anser anser) Discriminate between Individual Siblings

    Get PDF
    Social species that maintain individualised relationships with certain others despite continuous changes in age, reproductive status and dominance rank between group members ought to be capable of individual recognition. Tests of “true” individual recognition, where an individual recognises unique features of another, are rare, however. Often kinship and/or familiarity suffice to explain dyadic interactions. The complex relationships within a greylag goose flock suggest that they should be able to recognise individuals irrespective of familiarity or kinship. We tested whether six-week-old hand-raised greylags can discriminate between two of their siblings. We developed a new experimental protocol, in which geese were trained to associate social siblings with geometrical symbols. Subsequently, focals were presented with two geometrical symbols in the presence of a sibling associated with one of the symbols. Significant choice of the geometrical symbol associated with the target present indicated that focals were able to distinguish between individual targets. Greylag goslings successfully learned this association-discrimination task, regardless of genetic relatedness or sex of the sibling targets. Social relationships within a goose flock thus may indeed be based on recognition of unique features of individual conspecifics

    Artificial Neural Networks Optimization by means of Evolutionary Algorithms

    No full text
    In this paper Evolutionary Algorithms are investigated in the field of Artificial Neural Networks. In particular, the Breeder Genetic Algorithms are compared against Genetic Algorithms in facing contemporaneously the optimization of (i) the design of a neural network architecture and (ii) the choice of the best learning method for nonlinear system identification. The performance of the Breeder Genetic Algorithms is further improved by a fuzzy recombination operator. The experimental results for the two mentioned evolutionary optimization methods are presented and discussed. 1. Introduction E VOLUTIONARY Algorithms have been applied successfully to a wide variety of optimization problems. Recently a novel technique, the Breeder Genetic Algorithms (BGAs) [1, 2, 3] which can be seen as a combination of Evolution Strategies (ESs) [4] and Genetic Algorithms (GAs) [5, 6], has been introduced. BGAs use truncation selection which is very similar to the (¯; )--strategy in ESs and the search p..

    Optimizing Neural Networks for Time Series Prediction

    No full text
    In this paper we investigate the effective design of an appropriate neural network model for time series prediction based on an evolutionary approach. In particular, the Breeder Genetic Algorithms are considered to face contemporaneously the optimization of (i) the design of a neural network architecture and (ii) the choice of the best learning method. The effectiveness of the approach proposed is evaluated on a standard benchmark for prediction models, the Mackey--Glass series. 1. Introduction The main motivation for time series research is to provide a prediction when a mathematical model of a phenomenon is either unknown or incomplete. A time series consists of measurements or observations of the previous outcomes of a phenomenon that are made sequentially over time. If these consecutive observations are dependent on each other then it is possible to attempt a prediction. Clearly it is supposed that the process is somehow predictable. The time series prediction problems are usually..
    corecore