scispace - formally typeset
Journal ArticleDOI

Integrative network alignment reveals large regions of global network similarity in yeast and human

Oleksii Kuchaiev, +1 more
- 01 May 2011 - 
- Vol. 27, Iss: 10, pp 1390-1396
Reads0
Chats0
TLDR
A novel network alignment algorithm, called Matching-based Integrative GRAph ALigner (MI-GRAAL), which can integrate any number and type of similarity measures between network nodes (e.g. proteins), including, but not limited to, any topological network similarity measure, sequence similarity, functional similarity and structural similarity.
Abstract
Motivation: High-throughput methods for detecting molecular interactions have produced large sets of biological network data with much more yet to come. Analogous to sequence alignment, efficient and reliable network alignment methods are expected to improve our understanding of biological systems. Unlike sequence alignment, network alignment is computationally intractable. Hence, devising efficient network alignment heuristics is currently a foremost challenge in computational biology. Results: We introduce a novel network alignment algorithm, called Matching-based Integrative GRAph ALigner (MI-GRAAL), which can integrate any number and type of similarity measures between network nodes (e.g. proteins), including, but not limited to, any topological network similarity measure, sequence similarity, functional similarity and structural similarity. Hence, we resolve the ties in similarity measures and find a combination of similarity measures yielding the largest contiguous (i.e. connected) and biologically sound alignments. MI-GRAAL exposes the largest functional, connected regions of protein–protein interaction (PPI) network similarity to date: surprisingly, it reveals that 77.7% of proteins in the baker's yeast high-confidence PPI network participate in such a subnetwork that is fully contained in the human high-confidence PPI network. This is the first demonstration that species as diverse as yeast and human contain so large, continuous regions of global network similarity. We apply MI-GRAAL's alignments to predict functions of un-annotated proteins in yeast, human and bacteria validating our predictions in the literature. Furthermore, using network alignment scores for PPI networks of different herpes viruses, we reconstruct their phylogenetic relationship. This is the first time that phylogeny is exactly reconstructed from purely topological alignments of PPI networks. Availability: Supplementary files and MI-GRAAL executables: http://bio-nets.doc.ic.ac.uk/MI-GRAAL/. Contact: natasha@imperial.ac.uk Supplementary information:Supplementary data are available at Bioinformatics online.

read more

Citations
More filters
Journal ArticleDOI

Structure and dynamics of molecular networks: A novel paradigm of drug discovery: A comprehensive review

TL;DR: It is shown how network techniques can help in the identification of single-target, edgetic, multi-target and allo-network drug target candidates and an optimized protocol of network-aided drug development is suggested, and a list of systems-level hallmarks of drug quality is provided.
Journal ArticleDOI

Global network alignment using multiscale spectral signatures

TL;DR: GHOST is introduced, a global pairwise network aligner that uses a novel spectral signature to measure topological similarity between subnetworks and is able to recover larger and more biologically significant, shared subnets between species.
Journal ArticleDOI

A combinatorial approach to graphlet counting

TL;DR: A new combinatorial method is proposed that builds a system of equations that connect counts of orbits from graphlets with up to five nodes, which allows to compute all orbit counts by enumerating just a single one.
Journal ArticleDOI

NETAL: a new graph-based method for global alignment of protein–protein interaction networks

TL;DR: This work presents a novel algorithm, based on the alignment scoring matrix, which is derived from both biological and topological information of input networks to find the best global network alignment, and outperforms other global alignment methods in terms of several measurements.
Proceedings ArticleDOI

On the performance of percolation graph matching

TL;DR: A very simple percolation - based graph matching algorithm that incrementally maps every pair of nodes (i,j) with at least r neighboring mapped pairs is proposed and analyzed, which makes possible a rigorous analysis that relies on recent advances in bootstrappercolation theory for the G(n,p) random graph.
References
More filters
Journal ArticleDOI

Basic Local Alignment Search Tool

TL;DR: A new approach to rapid sequence comparison, basic local alignment search tool (BLAST), directly approximates alignments that optimize a measure of local similarity, the maximal segment pair (MSP) score.
Journal ArticleDOI

Gene Ontology: tool for the unification of biology

TL;DR: The goal of the Gene Ontology Consortium is to produce a dynamic, controlled vocabulary that can be applied to all eukaryotes even as knowledge of gene and protein roles in cells is accumulating and changing.
Journal Article

PHYLIP-Phylogeny inference package (Version 3.2)

J. Felsenstein
- 01 Jan 1989 - 
Book

Introduction to Graph Theory

TL;DR: In this article, the authors introduce the concept of graph coloring and propose a graph coloring algorithm based on the Eulers formula for k-chromatic graphs, which can be seen as a special case of the graph coloring problem.
Proceedings ArticleDOI

The complexity of theorem-proving procedures

TL;DR: It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology.
Related Papers (5)