Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Computational proteomics”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 433 records · Page 24Linked to original sources
PubMed2006

ProteomeCommons.org IO Framework: reading and writing multiple proteomics data formats.

MOTIVATION: Effective use of proteomics data, specifically mass spectrometry data, relies on the ability to read and write the many mass spectrometer file formats. Even with mass spectrometer vendor-specific libraries and vendor-neutral file formats, such as mzXML and mzData it can be difficult to extract raw data files in a form suitable for batch processing and basic research. Introduced here are the ProteomeCommons.org Input and Output Framework, abbreviated to IO Framework, which is designed to abstractly represent mass spectrometry data. This project is a public, open-source, free-to-use framework that supports most of the mass spectrometry data formats, including current formats, legacy formats and proprietary formats that require a vendor-specific library in order to operate. The IO Framework includes an on-line tool for non-programmers and a set of libraries that developers may use to convert between various proteomics file formats. AVAILABILITY: The current source-code and documentation for the ProteomeCommons.org IO Framework is freely available at http://www.proteomecommons.org/current/531/

Algorithms↗
PubMed2004

Functional evolution of the yeast protein interaction network.

Protein interactions are central to most biological processes. We investigated the dynamics of emergence of the protein interaction network of Saccharomyces cerevisiae by mapping origins of proteins on an evolutionary tree. We demonstrate that evolutionary periods are characterized by distinct connectivity levels of the emerging proteins. We found that the most-connected group of proteins dates to the eukaryotic radiation, and the more ancient group of pre-eukaryotic proteins is less connected. We show that functional classes have different average connectivity levels and that the time of emergence of these functional classes parallels the observed connectivity variation in evolution. We take these findings as evidence that the evolution of function might be the reason for the differences in connectivity throughout evolutionary time. We propose that the understanding of the mechanisms that generate the scale-free protein interaction network, and possibly other biological networks, requires consideration of protein function.

Computational Biology↗
PubMed2006

The Mouse Functional Genome Database (MfunGD): functional annotation of proteins in the light of their cellular context.

MfunGD (http://mips.gsf.de/genre/proj/mfungd/) provides a resource for annotated mouse proteins and their occurrence in protein networks. Manual annotation concentrates on proteins which are found to interact physically with other proteins. Accordingly, manually curated information from a protein-protein interaction database (MPPI) and a database of mammalian protein complexes is interconnected with MfunGD. Protein function annotation is performed using the Functional Catalogue (FunCat) annotation scheme which is widely used for the analysis of protein networks. The dataset is also supplemented with information about the literature that was used in the annotation process as well as links to the SIMAP Fasta database, the Pedant protein analysis system and cross-references to external resources. Proteins that so far were not manually inspected are annotated automatically by a graphical probabilistic model and/or superparamagnetic clustering. The database is continuously expanding to include the rapidly growing amount of functional information about gene products from mouse. MfunGD is implemented in GenRE, a J2EE-based component-oriented multi-tier architecture following the separation of concern principle.

Animals↗
PubMed2005

Are scale-free networks robust to measurement errors?

BACKGROUND: Many complex random networks have been found to be scale-free. Existing literature on scale-free networks has rarely considered potential false positive and false negative links in the observed networks, especially in biological networks inferred from high-throughput experiments. Therefore, it is important to study the impact of these measurement errors on the topology of the observed networks. RESULTS: This article addresses the impact of erroneous links on network topological inference and explores possible error mechanisms for scale-free networks with an emphasis on Saccharomyces cerevisiae protein interaction networks. We study this issue by both theoretical derivations and simulations. We show that the ignorance of erroneous links in network analysis may lead to biased estimates of the scale parameter and recommend robust estimators in such scenarios. Possible error mechanisms of yeast protein interaction networks are explored by comparisons between real data and simulated data. CONCLUSION: Our studies show that, in the presence of erroneous links, the connectivity distribution of scale-free networks is still scale-free for the middle range connectivities, but can be greatly distorted for low and high connecitivities. It is more appropriate to use robust estimators such as the least trimmed mean squares estimator to estimate the scale parameter gamma under such circumstances. Moreover, we show by simulation studies that the scale-free property is robust to some error mechanisms but untenable to others. The simulation results also suggest that different error mechanisms may be operating in the yeast protein interaction networks produced from different data sources. In the MIPS gold standard protein interaction data, there appears to be a high rate of false negative links, and the false negative and false positive rates are more or less constant across proteins with different connectivities. However, the error mechanism of yeast two-hybrid data may be very different, where the overall false negative rate is low and the false negative rates tend to be higher for links involving proteins with more interacting partners.

Algorithms↗
PubMed2006

A methodology for the structural and functional analysis of signaling and regulatory networks.

BACKGROUND: Structural analysis of cellular interaction networks contributes to a deeper understanding of network-wide interdependencies, causal relationships, and basic functional capabilities. While the structural analysis of metabolic networks is a well-established field, similar methodologies have been scarcely developed and applied to signaling and regulatory networks. RESULTS: We propose formalisms and methods, relying on adapted and partially newly introduced approaches, which facilitate a structural analysis of signaling and regulatory networks with focus on functional aspects. We use two different formalisms to represent and analyze interaction networks: interaction graphs and (logical) interaction hypergraphs. We show that, in interaction graphs, the determination of feedback cycles and of all the signaling paths between any pair of species is equivalent to the computation of elementary modes known from metabolic networks. Knowledge on the set of signaling paths and feedback loops facilitates the computation of intervention strategies and the classification of compounds into activators, inhibitors, ambivalent factors, and non-affecting factors with respect to a certain species. In some cases, qualitative effects induced by perturbations can be unambiguously predicted from the network scheme. Interaction graphs however, are not able to capture AND relationships which do frequently occur in interaction networks. The consequent logical concatenation of all the arcs pointing into a species leads to Boolean networks. For a Boolean representation of cellular interaction networks we propose a formalism based on logical (or signed) interaction hypergraphs, which facilitates in particular a logical steady state analysis (LSSA). LSSA enables studies on the logical processing of signals and the identification of optimal intervention points (targets) in cellular networks. LSSA also reveals network regions whose parametrization and initial states are crucial for the dynamic behavior. We have implemented these methods in our software tool CellNetAnalyzer (successor of FluxAnalyzer) and illustrate their applicability using a logical model of T-Cell receptor signaling providing non-intuitive results regarding feedback loops, essential elements, and (logical) signal processing upon different stimuli. CONCLUSION: The methods and formalisms we propose herein are another step towards the comprehensive functional analysis of cellular interaction networks. Their potential, shown on a realistic T-cell signaling model, makes them a promising tool.

Animals↗
PubMed2006

Protein ranking by semi-supervised network propagation.

BACKGROUND: Biologists regularly search DNA or protein databases for sequences that share an evolutionary or functional relationship with a given query sequence. Traditional search methods, such as BLAST and PSI-BLAST, focus on detecting statistically significant pairwise sequence alignments and often miss more subtle sequence similarity. Recent work in the machine learning community has shown that exploiting the global structure of the network defined by these pairwise similarities can help detect more remote relationships than a purely local measure. METHODS: We review RankProp, a ranking algorithm that exploits the global network structure of similarity relationships among proteins in a database by performing a diffusion operation on a protein similarity network with weighted edges. The original RankProp algorithm is unsupervised. Here, we describe a semi-supervised version of the algorithm that uses labeled examples. Three possible ways of incorporating label information are considered: (i) as a validation set for model selection, (ii) to learn a new network, by choosing which transfer function to use for a given query, and (iii) to estimate edge weights, which measure the probability of inferring structural similarity. RESULTS: Benchmarked on a human-curated database of protein structures, the original RankProp algorithm provides significant improvement over local network search algorithms such as PSI-BLAST. Furthermore, we show here that labeled data can be used to learn a network without any need for estimating parameters of the transfer function, and that diffusion on this learned network produces better results than the original RankProp algorithm with a fixed network. CONCLUSION: In order to gain maximal information from a network, labeled and unlabeled data should be used to extract both local and global structure.

Algorithms↗
PubMed2003

A need for a 'whole-istic functional genomics' approach in complex human diseases: arthritis.

'Genomic tools', such as gene/protein chips, single nucleotide polymorphism and haplotype analyses, are empowering us to generate staggering amounts of correlative data, from human/animal genetics and from normal and disease-affected tissues obtained from complex diseases such as arthritis. These tools are transforming molecular biology into a 'data rich' science, with subjects with an '-omic' suffix. These disciplines have to converge and integrate at a systemic level to examine the structure and dynamics of cellular and organismal function ('functionomics') simultaneously, using a multidimensional approach for cells, tissues, organs, rodents and Zebra fish models, which intertwines various approaches and readouts to study the development and homeostasis of a system. In summary, the postgenomic era of functionomics will facilitate narrowing the bridge between correlative data and causative data, thus integrating 'intercoms' of interacting and interdependent disciplines and forming a unified whole.

Arthritis↗
PubMed2003

Unraveling nature's networks.

A report on the meeting 'Unravelling Nature's Networks: from Microarray and Proteomic Analysis to Systems Biology', Sheffield, UK, 21-22 July 2003.

Cells↗
PubMed2025

IgStrand: A universal residue numbering scheme for the immunoglobulin-fold (Ig-fold) to study Ig-proteomes and Ig-interactomes.

The Immunoglobulin fold (Ig-fold) is found in proteins from all domains of life and represents the most populous fold in the human genome, with current estimates ranging from 2 to 3% of protein coding regions. That proportion is much higher in the surfaceome where Ig and Ig-like domains orchestrate cell-cell recognition, adhesion and signaling. The ability of Ig-domains to reliably fold and self-assemble through highly specific interfaces represents a remarkable property of these domains, making them key elements of molecular interaction systems: the immune system, the nervous system, the vascular system and the muscular system. We define a universal residue numbering scheme, common to all domains sharing the Ig-fold in order to study the wide spectrum of Ig-domain variants constituting the Ig-proteome and Ig-Ig interactomes at the heart of these systems. The "IgStrand numbering scheme" enables the identification of Ig structural proteomes and interactomes in and between any species, and comparative structural, functional, and evolutionary analyses. We review how Ig-domains are classified today as topological and structural variants and highlight the "Ig-fold irreducible structural signature" shared by all of them. The IgStrand numbering scheme lays the foundation for the systematic annotation of structural proteomes by detecting and accurately labeling Ig-, Ig-like and Ig-extended domains in proteins, which are poorly annotated in current databases and opens the door to accurate machine learning. Importantly, it sheds light on the robust Ig protein folding algorithm used by nature to form beta sandwich supersecondary structures. The numbering scheme powers an algorithm implemented in the interactive structural analysis software iCn3D to systematically recognize Ig-domains, annotate them and perform detailed analyses comparing any domain sharing the Ig-fold in sequence, topology and structure, regardless of their diverse topologies or origin. The scheme provides a robust fold detection and labeling mechanism that reveals unsuspected structural homologies among protein structures beyond currently identified Ig- and Ig-like domain variants. Indeed, multiple folds classified independently contain a common structural signature, in particular jelly-rolls. Examples of folds that harbor an "Ig-extended" architecture are given. Applications in protein engineering around the Ig-architecture are straightforward based on the universal numbering.

Humans↗
PubMed2024

Bioinformatics pipeline for the systematic mining genomic and proteomic variation linked to rare diseases: The example of monogenic diabetes.

Monogenic diabetes is characterized as a group of diseases caused by rare variants in single genes. Like for other rare diseases, multiple genes have been linked to monogenic diabetes with different measures of pathogenicity, but the information on the genes and variants is not unified among different resources, making it challenging to process them informatically. We have developed an automated pipeline for collecting and harmonizing data on genetic variants linked to monogenic diabetes. Furthermore, we have translated variant genetic sequences into protein sequences accounting for all protein isoforms and their variants. This allows researchers to consolidate information on variant genes and proteins linked to monogenic diabetes and facilitates their study using proteomics or structural biology. Our open and flexible implementation using Jupyter notebooks enables tailoring and modifying the pipeline and its application to other rare diseases.

Humans↗
PubMed2007

Organization of proteomics data with YassDB.

In recent years the organization of mass spectrometry (MS) data obtained in large-scale proteomics projects became an important issue. This has catalyzed the development of a few different database schemes for storing MS data, as well as some dedicated user interfaces. However, many of these projects are still rather immature and often do not cover all needs. Because our needs were quite specific, it was necessary to build a database that accommodates all the major types of experiments generated in house and that could be easily extended by new modules made by collaborators or students. A database application named "YassDB" will be described in this chapter. The application is implemented in a "three-tier" application architecture, with a database layer, a middle layer consisting of web services and a client layer, containing the user interface. This offers high flexibility: it allows other applications, written in any language, to be written as clients to the database. The setup and use of the YassDB database application with two client programs "pProRep" and "VEMS" will be outlined.

Databases, Protein↗
PubMed2003

New approaches for biomarker discovery in lung cancer.

Lung cancer remains the most common cause of cancer death in the US and worldwide. Currently, there is no implemented population-based screening for lung cancer. Of all the markers identified, none have achieved sufficient diagnostic significance to reach clinical application. Here we discuss the status of lung cancer early diagnostics, and the genomic and proteomic approaches currently undertaken for biomarker discovery. We then introduce the ANTIBIOMIX approach that enables high-throughput target discovery by interrogating biological samples using a collection of thousands of polyclonal antibodies. The development of specific and sensitive diagnostic assays using patient's biological fluids, such as sputum and serum, will improve screening, monitoring of disease progression and treatment response, and surveillance for recurrence.

Biomarkers, Tumor↗
PubMed2004

[Application of serum protein pattern model in diagnosis of colorectal cancer].

OBJECTIVE: To explore the application of serum protein pattern models in diagnosis of colorectal cancer (CRC) by proteinchip technology. METHODS: One hundred and forty-seven serum samples (55 CRC patients and 92 healthy individuals) randomly divided into training set (n = 87, 32 CRC patients and 55 healthy individuals) and test set (n = 60), were subjected for analysis by surface enhanced laser desorption/ionization-time of flight-mass spectrometry (SELDI-TOF-MS). Four top-scored peaks in 5910, 8930, 4476 and 8817 were detected by proteinchip software version 3.0. and were trained by a multi-layer artificial neural network (ANN) with a back propagation algorithm. An artificial neural network classifier had developed for separating CRC from the healthy group. The classifier was then challenged with the test set (60 samples including 23 CRC patients and 37 healthy individuals) to determine the validity and accuracy of the classification system. RESULTS: The artificial neural network classifier separated the CRC from the healthy samples, with sensitivity of 82.6% and specificity of 91.9%. CONCLUSION: Combination of SELDI-TOF-MS with the artificial neural network yields significant higher sensitivity and specificity than CEA in the diagnosis of CRC, which should be further studied.

Adult↗
PubMed2006

Increased protein yields from Escherichia coli using pressure-cycling technology.

Sample preparation is critical to the success of two-dimensional gel electrophoresis and other analytical methods. Pressure-cycling technology (PCT) uses alternating cycles of high and low pressure to induce cell lysis. Cell suspensions were placed in PULSE Tubes and subjected to alternating cycles of high and low pressure in a Barocycler instrument. each cycle consisted of 20 sec at 35,000 psi followed by 20 sec at ambient pressure. For the bacterium Escherichia coli, PCT extracted 14.2% more total protein than was extracted using a standard bead mill. Image analysis of two-dimensional gels revealed 801 protein spots in the PCT lysate, compared to 760 protein spots in the bead mill lysate.

Biotechnology↗