1,212 research outputs found

    Detecting Protein Function and Protein-Protein Interactions from Genome Sequences

    Full text link

    mspire: mass spectrometry proteomics in Ruby

    Get PDF
    Summary: Mass spectrometry-based proteomics stands to gain from additional analysis of its data, but its large, complex datasets make demands on speed and memory usage requiring special consideration from scripting languages. The software library ā€˜mspireā€™ā€”developed in the Ruby programming languageā€”offers quick and memory-efficient readers for standard xml proteomics formats, converters for intermediate file types in typical proteomics spectral-identification work flows (including the Bioworks .srf format), and modules for the calculation of peptide false identification rates

    NcPred for accurate nuclear protein prediction using n-mer statistics with various classification algorithms

    Get PDF
    Prediction of nuclear proteins is one of the major challenges in genome annotation. A method, NcPred is described, for predicting nuclear proteins with higher accuracy exploiting n-mer statistics with different classification algorithms namely Alternating Decision (AD) Tree, Best First (BF) Tree, Random Tree and Adaptive (Ada) Boost. On BaCello dataset [1], NcPred improves about 20% accuracy with Random Tree and about 10% sensitivity with Ada Boost for Animal proteins compared to existing techniques. It also increases the accuracy of Fungal protein prediction by 20% and recall by 4% with AD Tree. In case of Human protein, the accuracy is improved by about 25% and sensitivity about 10% with BF Tree. Performance analysis of NcPred clearly demonstrates its suitability over the contemporary in-silico nuclear protein classification research

    Application of regulatory sequence analysis and metabolic network analysis to the interpretation of gene expression data

    Get PDF
    We present two complementary approaches for the interpretation of clusters of co-regulated genes, such as those obtained from DNA chips and related methods. Starting from a cluster of genes with similar expression profiles, two basic questions can be asked: 1. Which mechanism is responsible for the coordinated transcriptional response of the genes? This question is approached by extracting motifs that are shared between the upstream sequences of these genes. The motifs extracted are putative cis-acting regulatory elements. 2. What is the physiological meaning for the cell to express together these genes? One way to answer the question is to search for potential metabolic pathways that could be catalyzed by the products of the genes. This can be done by selecting the genes from the cluster that code for enzymes, and trying to assemble the catalyzed reactions to form metabolic pathways. We present tools to answer these two questions, and we illustrate their use with selected examples in the yeast Saccharomyces cerevisiae. The tools are available on the web (http://ucmb.ulb.ac.be/bioinformatics/rsa-tools/; http://www.ebi.ac.uk/research/pfbp/; http://www.soi.city.ac.uk/~msch/)

    SATURN D6.5 - Final Report

    Get PDF
    The objective of the SATURN (Strategic Allocation of Traffic Using Redistribution in the Network) project is to make novel and credible use of market-based demand-management mechanisms to redistribute air traffic in the European airspace. This reduces congestion and saves the airspace users operational costs. The project is motivated by frequent demand and capacity imbalances in the European airspace network, which are forecast to continue in the near future. The present and foreseen ways of dealing with such imbalances mainly concern strategic and tactical capacity-side interventions, such as resectorisation and opening of more sectors to deal with excess demand. These are followed by tactical demand management measures, if needed. As a result, not only do substantial costs arise, but airspace users are also typically left with no choice but to comply with imposed air traffic flow management measures. The project shows how economic signals could be given to airspace users and air navigation service providers (ANSPs) to improve capacity-demand balancing, airspace design and usage, and what the benefits would be of a centralised planner compared with those of decentralised maximisation of self interests (by the ANSPs and/or airspace users)

    Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms

    Get PDF
    We reconsider the well-studied Selfish Routing game with affine latency functions. The Price of Anarchy for this class of games takes maximum value 4/3; this maximum is attained already for a simple network of two parallel links, known as Pigou's network. We improve upon the value 4/3 by means of Coordination Mechanisms. We increase the latency functions of the edges in the network, i.e., if ā„“e(x)\ell_e(x) is the latency function of an edge ee, we replace it by ā„“^e(x)\hat{\ell}_e(x) with ā„“e(x)ā‰¤ā„“^e(x)\ell_e(x) \le \hat{\ell}_e(x) for all xx. Then an adversary fixes a demand rate as input. The engineered Price of Anarchy of the mechanism is defined as the worst-case ratio of the Nash social cost in the modified network over the optimal social cost in the original network. Formally, if \CM(r) denotes the cost of the worst Nash flow in the modified network for rate rr and \Copt(r) denotes the cost of the optimal flow in the original network for the same rate then [\ePoA = \max_{r \ge 0} \frac{\CM(r)}{\Copt(r)}.] We first exhibit a simple coordination mechanism that achieves for any network of parallel links an engineered Price of Anarchy strictly less than 4/3. For the case of two parallel links our basic mechanism gives 5/4 = 1.25. Then, for the case of two parallel links, we describe an optimal mechanism; its engineered Price of Anarchy lies between 1.191 and 1.192.Comment: 17 pages, 2 figures, preliminary version appeared at ESA 201

    Yeast Protein Interactome Topology Provides Framework for Coordinated-Functionality

    Get PDF
    The architecture of the network of protein-protein physical interactions in Saccharomyces cerevisiae is exposed through the combination of two complementary theoretical network measures, betweenness centrality and `Q-modularity'. The yeast interactome is characterized by well-defined topological modules connected via a small number of inter-module protein interactions. Should such topological inter-module connections turn out to constitute a form of functional coordination between the modules, we speculate that this coordination is occurring typically in a pair-wise fashion, rather than by way of high-degree hub proteins responsible for coordinating multiple modules. The unique non-hub-centric hierarchical organization of the interactome is not reproduced by gene duplication-and-divergence stochastic growth models that disregard global selective pressures.Comment: Final, revised version. 13 pages. Please see Nucleic Acids open access article for higher resolution figure
    • ā€¦
    corecore