Search PubMed⌕ Search

Biomedical subjects

Stefan Wuchty

Publications and source records attributed to Stefan Wuchty.

9 recordsLinked to original sources

Topology and weights in a protein domain interaction network--a novel way to predict protein interactions.

BACKGROUND: While the analysis of unweighted biological webs as diverse as genetic, protein and metabolic networks allowed spectacular insights in the inner workings of a cell, biological networks are not only determined by their static grid of links. In fact, we expect that the heterogeneity in the utilization of connections has a major impact on the organization of cellular activities as well. RESULTS: We consider a web of interactions between protein domains of the Protein Family database (PFAM), which are weighted by a probability score. We apply metrics that combine the static layout and the weights of the underlying interactions. We observe that unweighted measures as well as their weighted counterparts largely share the same trends in the underlying domain interaction network. However, we only find weak signals that weights and the static grid of interactions are connected entities. Therefore assuming that a protein interaction is governed by a single domain interaction, we observe strong and significant correlations of the highest scoring domain interaction and the confidence of protein interactions in the underlying interactions of yeast and fly. Modeling an interaction between proteins if we find a high scoring protein domain interaction we obtain 1, 428 protein interactions among 361 proteins in the human malaria parasite Plasmodium falciparum. Assessing their quality by a logistic regression method we observe that increasing confidence of predicted interactions is accompanied by high scoring domain interactions and elevated levels of functional similarity and evolutionary conservation. CONCLUSION: Our results indicate that probability scores are randomly distributed, allowing to treat static grid and weights of domain interactions as separate entities. In particular, these finding confirms earlier observations that a protein interaction is a matter of a single interaction event on domain level. As an immediate application, we show a simple way to predict potential protein interactions by utilizing expectation scores of single domain interactions.

Animals↗

Stable evolutionary signal in a yeast protein interaction network.

BACKGROUND: The recently emerged protein interaction network paradigm can provide novel and important insights into the innerworkings of a cell. Yet, the heavy burden of both false positive and false negative protein-protein interaction data casts doubt on the broader usefulness of these interaction sets. Approaches focusing on one-protein-at-a-time have been powerfully employed to demonstrate the high degree of conservation of proteins participating in numerous interactions; here, we expand his 'node' focused paradigm to investigate the relative persistence of 'link' based evolutionary signals in a protein interaction network of S. cerevisiae and point out the value of this relatively untapped source of information. RESULTS: The trend for highly connected proteins to be preferably conserved in evolution is stable, even in the context of tremendous noise in the underlying protein interactions as well as in the assignment of orthology among five higher eukaryotes. We find that local clustering around interactions correlates with preferred evolutionary conservation of the participating proteins; furthermore the correlation between high local clustering and evolutionary conservation is accompanied by a stable elevated degree of coexpression of the interacting proteins. We use this conserved interaction data, combined with P. falciparum/Yeast orthologs, as proof-of-principle that high-order network topology can be used comparatively to deduce local network structure in non-model organisms. CONCLUSION: High local clustering is a criterion for the reliability of an interaction and coincides with preferred evolutionary conservation and significant coexpression. These strong and stable correlations indicate that evolutionary units go beyond a single protein to include the interactions among them. In particular, the stability of these signals in the face of extreme noise suggests that empirical protein interaction data can be integrated with orthologous clustering around these protein interactions to reliably infer local network structures in non-model organisms.

Evolution, Molecular↗

Evolutionary cores of domain co-occurrence networks.

BACKGROUND: The modeling of complex systems, as disparate as the World Wide Web and the cellular metabolism, as networks has recently uncovered a set of generic organizing principles: Most of these systems are scale-free while at the same time modular, resulting in a hierarchical architecture. The structure of the protein domain network, where individual domains correspond to nodes and their co-occurrences in a protein are interpreted as links, also falls into this category, suggesting that domains involved in the maintenance of increasingly developed, multicellular organisms accumulate links. Here, we take the next step by studying link based properties of the protein domain co-occurrence networks of the eukaryotes S. cerevisiae, C. elegans, D. melanogaster, M. musculus and H. sapiens. RESULTS: We construct the protein domain co-occurrence networks from the PFAM database and analyze them by applying a k-core decomposition method that isolates the globally central (highly connected domains in the central cores) from the locally central (highly connected domains in the peripheral cores) protein domains through an iterative peeling process. Furthermore, we compare the subnetworks thus obtained to the physical domain interaction network of S. cerevisiae. We find that the innermost cores of the domain co-occurrence networks gradually grow with increasing degree of evolutionary development in going from single cellular to multicellular eukaryotes. The comparison of the cores across all the organisms under consideration uncovers patterns of domain combinations that are predominately involved in protein functions such as cell-cell contacts and signal transduction. Analyzing a weighted interaction network of PFAM domains of yeast, we find that domains having only a few partners frequently interact with these, while the converse is true for domains with a multitude of partners. Combining domain co-occurrence and interaction information, we observe that the co-occurrence of domains in the innermost cores (globally central domains) strongly coincides with physical interaction. The comparison of the multicellular eukaryotic domain co-occurrence networks with the single celled of S. cerevisiae (the overlap network) uncovers small, connected network patterns. CONCLUSION: We hypothesize that these patterns, consisting of the domains and links preserved through evolution, may constitute nucleation kernels for the evolutionary increase in proteome complexity. Combining co-occurrence and physical interaction data we argue that the driving force behind domain fusions is a collective effect caused by the number of interactions and not the individual interaction frequency.

Animals↗

Peeling the yeast protein network.

A set of highly connected proteins (or hubs) plays an important role for the integrity of the protein interaction network of Saccharomyces cerevisae by connecting the network's intrinsic modules. The importance of the hubs' central placement is further confirmed by their propensity to be lethal. However, although highly emphasized, little is known about the topological coherence among the hubs. Applying a core decomposition method which allows us to identify the inherent layer structure of the protein interaction network, we find that the probability of nodes both being essential and evolutionary conserved successively increases toward the innermost cores. While connectivity alone is often not a sufficient criterion to assess a protein's functional, evolutionary and topological relevance, we classify nodes as globally and locally central depending on their appearance in the inner or outer cores. The observation that globally central proteins participate in a substantial number of protein complexes which display an elevated degree of evolutionary conservation allows us to hypothesize that globally central proteins serve as the evolutionary backbone of the proteome. Even though protein interaction data are extensively flawed, we find that our results are very robust against inaccurately determined protein interactions.

Databases, Protein↗

Evolution and topology in the yeast protein interaction network.

The integrity of the yeast protein-protein interaction network is maintained by a few highly connected proteins, or hubs, which hold the numerous less-connected proteins together. The structural importance and the increased essentiality of these proteins suggest that they are likely to be conserved in evolution, implying a strong relationship between the number of interactions and their evolutionary distance to its orthologs in other organisms. The existence of this coherence was recently reported to strongly depend on the quality of the protein interaction and orthologs data. Here, we introduce a novel method, the evolutionary excess retention (ER), allowing us to uncover a robust and strong correlation between the conservation, essentiality, and connectivity of a yeast protein. We conclude that the relevance of the hubs for the network integrity is simultaneously reflected by a considerable probability of simultaneously being evolutionarily conserved and essential, an observation that does not have an equivalent for nonessential proteins. Providing a thorough assessment of the impact noisy and incomplete data have on our findings, we conclude that our results are largely insensitive to the quality of the utilized data.

Animals↗

CombAlign: a protein sequence comparison algorithm considering recombinations.

The basic linear treatment of sequence comparisons limits the ability of contemporary sequence alignment algorithms to detect non-order-conserving recombinations. Here, we introduce the algorithm combAlign which addresses the assessment of pairwise sequence similarity on non-order-conserving recombinations on a large scale. Emphasizing a two-level approach, combAlign first detects locally well conserved subsequences in a target and a source sequence. Subsequently, the relative placement of alignments is mapped to a graph. Concatenating local alignments to reassemble the target sequence to the fullest extent, the maximum scoring path through the graph denotes the best attainable combAlignment. Parameters influencing this process can be set to meet the user's specific demands. combAlign is applied to examples demonstrating the possibility to reflect evolutionary kinship of proteins even if their domains and motifs are strongly rearranged.

Algorithms↗

Centers of complex networks.

The central vertices in complex networks are of particular interest because they might play the role of organizational hubs. Here, we consider three different geometric centrality measures, excentricity, status, and centroid value, that were originally used in the context of resource placement problems. We show that these quantities lead to useful descriptions of the centers of biological networks which often, but not always, correlate with a purely local notion of centrality such as the vertex degree. We introduce the notion of local centers as local optima of a centrality value "landscape" on a network and discuss briefly their role.

Computer Simulation↗

Small worlds in RNA structures.

I consider conformational spaces of tRNA(phe) defined by sets of suboptimal structures from the perspective of small-world networks. Herein, the influence of modifications on typical small-world network properties and the shape of energy landscapes is discussed. Results indicate that natural modifications influence the degree of local clustering and mean path lengths far more than random or no modifications. High frequencies in the thermodynamic ensemble coincide with high numbers of neighboring structures that one conformation can adopt by one elementary move. Conformation spaces indicate the existence of modular substructures. It can be shown that modifications leave the nature of small-world topology untouched albeit natural modifications have a reasonable enhancing and streamlining effect on the degree of clustering and therefore on the substructures of the conformational space.

Algorithms↗

Interaction and domain networks of yeast.

Data of currently available protein-protein interaction sets and protein domain sets of yeast are used to set up protein and domain interaction and domain sequence networks. All of them are far from being random or regular networks. In fact, they turn out to be sparse and locally well clustered indicating so-called scale-free and partially small-world topology. These subtle topologies display considerable indirect properties which are measured with a newly introduced transitivity coefficient. Fairly small sets of highly connected proteins and domains shape the topologies of the underlying networks, emphasizing a kind of backbone the nets are based on. The biological nature of these particular nodes is further investigated. Since highly connected proteins and domains accumulated a significant higher number of links by their important involvement in certain cellular aspects, their mutational effect on the cell is considered by a perturbation analysis. In comparison to domains of yeast, what factors force domains to accumulate links to other domains in protein sequences of higher eukaryotes are investigated.

Data Interpretation, Statistical↗