A new approach for potential drug target discovery through in silico metabolic pathway analysis using Trypanosoma cruzi genome information

The current drug options for the treatment of chronic Chagas disease have not been sufficient and high hopes have been placed on the use of genomic data from the human parasite Trypanosoma cruzi to identify new drug targets and develop appropriate treatments for both acute and chronic Chagas disease. However, the lack of a complete assembly of the genomic sequence and the presence of many predicted proteins with unknown or unsure functions has hampered our complete view of the parasite's metabolic pathways. Moreover, pinpointing new drug targets has proven to be more complex than anticipated and has revealed large holes in our understanding of metabolic pathways and their integrated regulation, not only for this parasite, but for many other similar pathogens. Using an in silicocomparative study on pathway annotation and searching for analogous and specific enzymes, we have been able to predict a considerable number of additional enzymatic functions in T. cruzi. Here we focus on the energetic pathways, such as glycolysis, the pentose phosphate shunt, the Krebs cycle and lipid metabolism. We point out many enzymes that are analogous to those of the human host, which could be potential new therapeutic targets.

Chagas disease, adipose tissue and the metabolic syndrome

Trypanosoma cruzi infection of the adipose tissue of mice triggers the local expression of inflammatory mediators and a reduction in the expression of the adipokine adiponectin. T. cruzi can be detected in adipose tissue by PCR 300 days post-infection. Infection of cultured adipocytes results in increased expression of cytokines and chemokines and a reduction in the expression of adiponectin and the peroxisome proliferator-activated receptor ³, both of which are negative regulators of inflammation. Infection also results in the upregulation of cyclin D1, the Notch pathway, and extracellular signal-regulated kinase and a reduction in the expression of caveolin-1. Thus, T. cruzi infection of cultured adipocytes leads to an upregulation of the inflammatory process. Since adiponectin null mice have a cardiomyopathic phenotype, it is possible that the reduction in adiponectin contributes to the pathogenesis of chagasic cardiomyopathy. Adipose tissue may serve as a reservoir for T. cruzi from which parasites can become reactivated during periods of immunosuppression. T. cruzi infection of mice often results in hypoglycemia. In contrast, hyperglycemia as observed in diabetes results in increased parasitemia and mortality. Adipose tissue is an important target tissue of T. cruzi and the infection of this tissue is associated with a profound impact on systemic metabolism, increasing the risk of metabolic syndrome.

A quality-based cost distribution charging scheme for QoS multicast networks

This paper presents a new charging scheme for cost distribution along a point-to-multipoint connection when destination nodes are responsible for the cost. The scheme focus on QoS considerations and a complete range of choices is presented. These choices go from a safe scheme for the network operator to a fair scheme to the customer. The in-between cases are also covered. Specific and general problems, like the incidence of users disconnecting dynamically is also discussed. The aim of this scheme is to encourage the users to disperse the resource demand instead of having a large number of direct connections to the source of the data, which would result in a higher than necessary bandwidth use from the source. This would benefit the overall performance of the network. The implementation of this task must balance between the necessity to offer a competitive service and the risk of not recovering such service cost for the network operator. Throughout this paper reference to multicast charging is made without making any reference to any specific category of service. The proposed scheme is also evaluated with the criteria set proposed in the European ATM charging project CANCAN

Evaluating the probability and the impact of a failure in GMPLS based networks

In this paper, we define a new scheme to develop and evaluate protection strategies for building reliable GMPLS networks. This is based on what we have called the network protection degree (NPD). The NPD consists of an a priori evaluation, the failure sensibility degree (FSD), which provides the failure probability, and an a posteriori evaluation, the failure impact degree (FID), which determines the impact on the network in case of failure, in terms of packet loss and recovery time. Having mathematical formulated these components, experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms in order to offer a certain degree of protection

Enhancing fault management performance of two-step QoS routing algorithms in GMPLS networks

In this paper a novel methodology aimed at minimizing the probability of network failure and the failure impact (in terms of QoS degradation) while optimizing the resource consumption is introduced. A detailed study of MPLS recovery techniques and their GMPLS extensions are also presented. In this scenario, some features for reducing the failure impact and offering minimum failure probabilities at the same time are also analyzed. Novel two-step routing algorithms using this methodology are proposed. Results show that these methods offer high protection levels with optimal resource consumption

An improved method for discovering link criticality in transport networks

Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network's resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio

Full label space reduction in MPLS networks: asymmetric merged tunneling

Traffic Engineering objective is to optimize network resource utilization. Although several works have been published about minimizing network resource utilization in MPLS networks, few of them have been focused in LSR label space reduction. This letter studies Asymmetric Merged Tunneling (AMT) as a new method for reducing the label space in MPLS network. The proposed method may be regarded as a combination of label merging (proposed in the MPLS architecture) and asymmetric tunneling (proposed recently in our previous works). Finally, simulation results are performed by comparing AMT with both ancestors. They show a great improvement in the label space reduction factor

Label Space Reduction in MPLS Networks: How Much Can A Single Stacked Label Do?

Most network operators have considered reducing LSR label spaces (number of labels used) as a way of simplifying management of underlaying virtual private networks (VPNs) and therefore reducing operational expenditure (OPEX). The IETF outlined the label merging feature in MPLS-allowing the configuration of multipoint-to-point connections (MP2P)-as a means of reducing label space in LSRs. We found two main drawbacks in this label space reduction a)it should be separately applied to a set of LSPs with the same egress LSR-which decreases the options for better reductions, and b)LSRs close to the edge of the network experience a greater label space reduction than those close to the core. The later implies that MP2P connections reduce the number of labels asymmetrically

Partial disjoint path for multi-layer protection in GMPLS networks

In this paper, different recovery methods applied at different network layers and time scales are used in order to enhance the network reliability. Each layer deploys its own fault management methods. However, current recovery methods are applied to only a specific layer. New protection schemes, based on the proposed partial disjoint path algorithm, are defined in order to avoid protection duplications in a multi-layer scenario. The new protection schemes also encompass shared segment backup computation and shared risk link group identification. A complete set of experiments proves the efficiency of the proposed methods in relation with previous ones, in terms of resources used to protect the network, the failure recovery time and the request rejection ratio

Enhanced multi-layer protection in multi-service GMPLS networks

This paper focuses on QoS routing with protection in an MPLS network over an optical layer. In this multi-layer scenario each layer deploys its own fault management methods. A partially protected optical layer is proposed and the rest of the network is protected at the MPLS layer. New protection schemes that avoid protection duplications are proposed. Moreover, this paper also introduces a new traffic classification based on the level of reliability. The failure impact is evaluated in terms of recovery time depending on the traffic class. The proposed schemes also include a novel variation of minimum interference routing and shared segment backup computation. A complete set of experiments proves that the proposed schemes are more efficient as compared to the previous ones, in terms of resources used to protect the network, failure impact and the request rejection ratio

Adding new components to the knowledge plane GMPLS over WDM networks

A recent study defines a new network plane: the knowledge plane. The incorporation of the knowledge plane over the network allows having more accurate information of the current and future network states. In this paper, the introduction and management of the network reliability information in the knowledge plane is proposed in order to improve the quality of service with protection routing algorithms in GMPLS over WDM networks. Different experiments prove the efficiency and scalability of the proposed scheme in terms of the percentage of resources used to protect the network

Estimation of the probability of congestion using Monte Carlo method in OPS networks

In networks with small buffers, such as optical packet switching based networks, the convolution approach is presented as one of the most accurate method used for the connection admission control. Admission control and resource management have been addressed in other works oriented to bursty traffic and ATM. This paper focuses on heterogeneous traffic in OPS based networks. Using heterogeneous traffic and bufferless networks the enhanced convolution approach is a good solution. However, both methods (CA and ECA) present a high computational cost for high number of connections. Two new mechanisms (UMCA and ISCA) based on Monte Carlo method are proposed to overcome this drawback. Simulation results show that our proposals achieve lower computational cost compared to enhanced convolution approach with an small stochastic error in the probability estimation

Guidelines for specialized nutritional and metabolic support in the critically-ill patient. Update. Consensus SEMICYUC-SENPE: Obese patient

As a response to metabolic stress, obese critically-ill patients have the same risk of nutritional deficiency as the non-obese and can develop protein-energy malnutrition with accelerated loss of muscle mass. The primary aim of nutritional support in these patients should be to minimize loss of lean mass and accurately evaluate energy expenditure. However, routinely used formulae can overestimate calorie requirements if the patient's actual weight is used. Consequently, the use of adjusted or ideal weight is recommended with these formulae, although indirect calorimetry is the method of choice. Controversy surrounds the question of whether a strict nutritional support criterion, adjusted to the patient's requirements, should be applied or whether a certain degree of hyponutrition should be allowed. Current evidence suggested that hypocaloric nutrition can improve results, partly due to a lower rate of infectious complications and better control of hyperglycemia. Therefore, hypocaloric and hyperproteic nutrition, whether enteral or parenteral, should be standard practice in the nutritional support of critically-ill obese patients when not contraindicated. Widely accepted recommendations consist of no more than 60-70% of requirements or administration of 11-14 kcal/kg current body weight/day or 22-25 kcal/kg ideal weight/day, with 2-2.5 g/kg ideal weight/day of proteins. In a broad sense, hypocaloric-hyperprotein regimens can be considered specific to obese critically-ill patients, although the complications related to comorbidities in these patients may require other therapeutic possibilities to be considered, with specific nutrients for hyperglycemia, acute respiratory distress syndrome (ARDS) and sepsis. However, there are no prospective randomized trials with this type of nutrition in this specific population subgroup and the available data are drawn from the general population of critically-ill patients. Consequently, caution should be exercised when interpreting these data.

Modeling stochasticity and robustness in gene regulatory networks.

MOTIVATION: Understanding gene regulation in biological processes and modeling the robustness of underlying regulatory networks is an important problem that is currently being addressed by computational systems biologists. Lately, there has been a renewed interest in Boolean modeling techniques for gene regulatory networks (GRNs). However, due to their deterministic nature, it is often difficult to identify whether these modeling approaches are robust to the addition of stochastic noise that is widespread in gene regulatory processes. Stochasticity in Boolean models of GRNs has been addressed relatively sparingly in the past, mainly by flipping the expression of genes between different expression levels with a predefined probability. This stochasticity in nodes (SIN) model leads to over representation of noise in GRNs and hence non-correspondence with biological observations. RESULTS: In this article, we introduce the stochasticity in functions (SIF) model for simulating stochasticity in Boolean models of GRNs. By providing biological motivation behind the use of the SIF model and applying it to the T-helper and T-cell activation networks, we show that the SIF model provides more biologically robust results than the existing SIN model of stochasticity in GRNs. AVAILABILITY: Algorithms are made available under our Boolean modeling toolbox, GenYsis. The software binaries can be downloaded from http://si2.epfl.ch/ approximately garg/genysis.html.