Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Philipp Pagel

dblp:98/760 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 6 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
4 papers
Bioinformatics and computational biology · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › structural biology › protein structure and function
protein structure and interaction
0.212013
Self-interaction of transmembrane helices representing pre-clusters from the human single-span membrane proteins · Bioinform. 2013
Bioinformatics and computational biology › protein analysis › protein-protein interaction
protein-protein interaction network analysis
0.112009
Enumeration of condition-dependent dense modules in protein interaction networks · Bioinform. 2009
Bioinformatics and computational biology › protein structure analysis
protein domain analysis
0.112006
The DIMA web resource - exploring the protein domain network · Bioinform. 2006
Bioinformatics and computational biology › biological database
protein interaction database
0.112005
The MIPS mammalian protein?Cprotein interaction database · Bioinform. 2005
Bioinformatics and computational biology › protein sequence analysis
protein sequence clustering
0.012013
Self-interaction of transmembrane helices representing pre-clusters from the human single-span membrane proteins · Bioinform. 2013
Bioinformatics and computational biology
systems biology
0.012009
Enumeration of condition-dependent dense modules in protein interaction networks · Bioinform. 2009

Methods — techniques the papers use, named apart from their topics

sequence similarity thresholding · 0.2mutational analysis · 0.2weighted network analysis · 0.1reverse search · 0.1phylogenetic profiling · 0.1
YearPublicationVenuePosition
2013 Self-interaction of transmembrane helices representing pre-clusters from the human single-span membrane proteins
abstract
MOTIVATION: Most integral membrane proteins form dimeric or oligomeric complexes. Oligomerization is frequently supported by the non-covalent interaction of transmembrane helices. It is currently not clear how many high-affinity transmembrane domains (TMD) exist in a proteome and how specific their interactions are with respect to preferred contacting faces and their underlying residue motifs. RESULTS: We first identify a threshold of 55% sequence similarity, which demarcates the border between meaningful alignments of TMDs and chance alignments. Clustering the human single-span membrane proteome using this threshold groups ~40% of the TMDs. The homotypic interaction of the TMDs representing the 33 largest clusters was systematically investigated under standardized conditions. The results reveal a broad distribution of relative affinities. High relative affinity frequently coincides with (i) the existence of a preferred helix-helix interface and (ii) sequence specificity as indicated by reduced affinity after mutating conserved residues. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Jan Kirrbach, Miriam Krugliak, Christian L. Ried, Philipp Pagel, Isaiah T. Arkin, Dieter Langosch
Bioinform.4
2010 Correlated Mutations: A Hallmark of Phenotypic Amino Acid Substitutions
abstract
Point mutations resulting in the substitution of a single amino acid can cause severe functional consequences, but can also be completely harmless. Understanding what determines the phenotypical impact is important both for planning targeted mutation experiments in the laboratory and for analyzing naturally occurring mutations found in patients. Common wisdom suggests using the extent of evolutionary conservation of a residue or a sequence motif as an indicator of its functional importance and thus vulnerability in case of mutation. In this work, we put forward the hypothesis that in addition to conservation, co-evolution of residues in a protein influences the likelihood of a residue to be functionally important and thus associated with disease. While the basic idea of a relation between co-evolution and functional sites has been explored before, we have conducted the first systematic and comprehensive analysis of point mutations causing disease in humans with respect to correlated mutations. We included 14,211 distinct positions with known disease-causing point mutations in 1,153 human proteins in our analysis. Our data show that (1) correlated positions are significantly more likely to be disease-associated than expected by chance, and that (2) this signal cannot be explained by conservation patterns of individual sequence positions. Although correlated residues have primarily been used to predict contact sites, our data are in agreement with previous observations that (3) many such correlations do not relate to physical contacts between amino acid residues. Access to our analysis results are provided at http://webclu.bio.wzw.tum.de/~pagel/supplements/correlated-positions/.
Andreas Kowarsch, Angelika Fuchs, Dmitrij Frishman, Philipp Pagel
PLoS Comput. Biol.4
2009 Enumeration of condition-dependent dense modules in protein interaction networks
abstract
MOTIVATION: Modern systems biology aims at understanding how the different molecular components of a biological cell interact. Often, cellular functions are performed by complexes consisting of many different proteins. The composition of these complexes may change according to the cellular environment, and one protein may be involved in several different processes. The automatic discovery of functional complexes from protein interaction data is challenging. While previous approaches use approximations to extract dense modules, our approach exactly solves the problem of dense module enumeration. Furthermore, constraints from additional information sources such as gene expression and phenotype data can be integrated, so we can systematically mine for dense modules with interesting profiles. RESULTS: Given a weighted protein interaction network, our method discovers all protein sets that satisfy a user-defined minimum density threshold. We employ a reverse search strategy, which allows us to exploit the density criterion in an efficient way. Our experiments show that the novel approach is feasible and produces biologically meaningful results. In comparative validation studies using yeast data, the method achieved the best overall prediction performance with respect to confirmed complexes. Moreover, by enhancing the yeast network with phenotypic and phylogenetic profiles and the human network with tissue-specific expression data, we identified condition-dependent complex variants. AVAILABILITY: A C++ implementation of the algorithm is available at http://www.kyb.tuebingen.mpg.de/~georgii/dme.html. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Elisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, Koji Tsuda
Bioinform.4
2007 Mining expression-dependent modules in the human interaction network
abstract
We analysed human interaction data from MINT, Intact, HPRD, and DIP in the context of tissue-specific gene expression data in human provided by Su et al . [ 3 ]. We discretized the expression information into binary states (expressed versus not expressed) and searched for densely connected modules where all proteins are expressed in at least 3 tissues and all proteins are not expressed in at least 10 tissues. To deal with the fact that protein interaction data contain a high number of false positives, we computed reliability scores for each experimental source. Similarly to the work by Jansen et al . [ 4 ], we used for that purpose a gold standard set of known interactions as well as a gold standard set of false interactions and calculated the likelihood ratio, which was used to assign edge weights to the interaction graph. The density of a module is defined as the sum of the edge weights inside the module divided by the maximal possible weight sum for a module of that size. Setting the minimum density threshold to 35% and removing modules that are totally contained in other modules, we obtained a set of 949 differentially expressed modules. They were ranked in descending order according to the average weight per node (see [ 5 ]), so larger and denser modules appear first. On the one hand, we discovered known complexes and modules that link strongly cooperating complexes like MCM and ORC. On the other hand, we found extensions of known complexes that confirm hypothetical functional annotation in Uniprot as well as modules which are not contained in the manually curated set of known complexes, but share the same functional annotation. Finally, some modules are candidates for further biological investigation, containing proteins with unknown functional relationships. We developed a general method for exhaustive dense module extraction from networks. Remarkably, it allows to determine exact P-values for the predicted modules without having to rely on any network model and can easily integrate information from different heterogeneous data sources.
Elisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, Koji Tsuda
BMC Bioinform.4
2006 The DIMA web resource - exploring the protein domain network
abstract
UNLABELLED: Conserved domains represent essential building blocks of most known proteins. Owing to their role as modular components carrying out specific functions they form a network based both on functional relations and direct physical interactions. We have previously shown that domain interaction networks provide substantially novel information with respect to networks built on full-length protein chains. In this work we present a comprehensive web resource for exploring the Domain Interaction MAp (DIMA), interactively. The tool aims at integration of multiple data sources and prediction techniques, two of which have been implemented so far: domain phylogenetic profiling and experimentally demonstrated domain contacts from known three-dimensional structures. A powerful yet simple user interface enables the user to compute, visualize, navigate and download domain networks based on specific search criteria. AVAILABILITY: http://mips.gsf.de/genre/proj/dima
Philipp Pagel, Matthias Oesterheld, Volker Stümpflen, Dmitrij Frishman
Bioinform.1
2005 The MIPS mammalian protein?Cprotein interaction database
abstract
Abstract Summary: The MIPS mammalian protein–protein interaction database (MPPI) is a new resource of high-quality experimental protein interaction data in mammals. The content is based on published experimental evidence that has been processed by human expert curators. We provide the full dataset for download and a flexible and powerful web interface for users with various requirements. Availability: The MPPI database is located at http://mips.gsf.de/proj/ppi/ Contact: [email protected]
Philipp Pagel, Stefan Kovac, Matthias Oesterheld, Barbara Brauner, Irmtraud Dunger, Goar Frishman, Corinna Montrone, Pekka Mark, Volker Stümpflen, Hans-Werner Mewes, Andreas Ruepp, Dmitrij Frishman
Bioinform.1