Alignment-free protein interaction network comparison

被引:40
作者
Ali, Waqar [1 ]
Rito, Tiago [1 ]
Reinert, Gesine [1 ]
Sun, Fengzhu [2 ]
Deane, Charlotte M. [1 ]
机构
[1] Univ Oxford, Dept Stat, Oxford OX1 3TG, England
[2] Univ So Calif, Dept Biol Sci, Mol & Computat Biol Program, Los Angeles, CA 90089 USA
基金
英国工程与自然科学研究理事会; 英国生物技术与生命科学研究理事会;
关键词
GLOBAL ALIGNMENT; DATABASE; IDENTIFICATION; GENERATION;
D O I
10.1093/bioinformatics/btu447
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Motivation: Biological network comparison software largely relies on the concept of alignment where close matches between the nodes of two or more networks are sought. These node matches are based on sequence similarity and/or interaction patterns. However, because of the incomplete and error-prone datasets currently available, such methods have had limited success. Moreover, the results of network alignment are in general not amenable for distance-based evolutionary analysis of sets of networks. In this article, we describe Netdis, a topology-based distance measure between networks, which offers the possibility of network phylogeny reconstruction. Results: We first demonstrate that Netdis is able to correctly separate different random graph model types independent of network size and density. The biological applicability of the method is then shown by its ability to build the correct phylogenetic tree of species based solely on the topology of current protein interaction networks. Our results provide new evidence that the topology of protein interaction networks contains information about evolutionary processes, despite the lack of conservation of individual interactions. As Netdis is applicable to all networks because of its speed and simplicity, we apply it to a large collection of biological and non-biological networks where it clusters diverse networks by type.
引用
收藏
页码:I430 / I437
页数:8
相关论文
共 47 条
  • [1] Evolutionary analysis reveals low coverage as the major challenge for protein interaction network alignment
    Ali, Waqar
    Deane, Charlotte M.
    [J]. MOLECULAR BIOSYSTEMS, 2010, 6 (11) : 2296 - 2304
  • [2] BEAMS: backbone extraction and merge strategy for the global many-to-many alignment of multiple PPI networks
    Alkan, Ferhat
    Erten, Cesim
    [J]. BIOINFORMATICS, 2014, 30 (04) : 531 - 539
  • [3] Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
    Altschul, SF
    Madden, TL
    Schaffer, AA
    Zhang, JH
    Zhang, Z
    Miller, W
    Lipman, DJ
    [J]. NUCLEIC ACIDS RESEARCH, 1997, 25 (17) : 3389 - 3402
  • [4] [Anonymous], 2003, Oxford studies in probability
  • [5] [Anonymous], 1993, Algebraic Models for Social Network
  • [6] The average distances in random graphs with given expected degrees
    Chung, F
    Lu, LY
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2002, 99 (25) : 15879 - 15882
  • [7] The identification of similarities between biological networks: Application to the metabolome and interactome
    Cootes, Adrian P.
    Muggleton, Stephen H.
    Sternberg, Michael J. E.
    [J]. JOURNAL OF MOLECULAR BIOLOGY, 2007, 369 (04) : 1126 - 1139
  • [8] Protein interactions - Two methods for assessment of the reliability of high throughput observations
    Deane, CM
    Salwinski, L
    Xenarios, I
    Eisenberg, D
    [J]. MOLECULAR & CELLULAR PROTEOMICS, 2002, 1 (05) : 349 - 356
  • [9] ERDOS P, 1960, B INT STATIST INST, V38, P343
  • [10] Automatic Parameter Learning for Multiple Local Network Alignment
    Flannick, Jason
    Novak, Antal
    Do, Chuong B.
    Srinivasan, Balaji S.
    Batzoglou, Serafim
    [J]. JOURNAL OF COMPUTATIONAL BIOLOGY, 2009, 16 (08) : 1001 - 1022