• DocumentCode
    1300
  • Title

    Characterizing the Topology of Probabilistic Biological Networks

  • Author

    Todor, Andrei ; Dobra, Alin ; Kahveci, Tamer

  • Author_Institution
    Dept. of Comput. & Inf. Sci. & Eng., Univ. of Florida, Gainesville, FL, USA
  • Volume
    10
  • Issue
    4
  • fYear
    2013
  • fDate
    July-Aug. 2013
  • Firstpage
    970
  • Lastpage
    983
  • Abstract
    Biological interactions are often uncertain events, that may or may not take place with some probability. This uncertainty leads to a massive number of alternative interaction topologies for each such network. The existing studies analyze the degree distribution of biological networks by assuming that all the given interactions take place under all circumstances. This strong and often incorrect assumption can lead to misleading results. In this paper, we address this problem and develop a sound mathematical basis to characterize networks in the presence of uncertain interactions. Using our mathematical representation, we develop a method that can accurately describe the degree distribution of such networks. We also take one more step and extend our method to accurately compute the joint-degree distributions of node pairs connected by edges. The number of possible network topologies grows exponentially with the number of uncertain interactions. However, the mathematical model we develop allows us to compute these degree distributions in polynomial time in the number of interactions. Our method works quickly even for entire protein-protein interaction (PPI) networks. It also helps us find an adequate mathematical model using MLE. We perform a comparative study of node-degree and joint-degree distributions in two types of biological networks: the classical deterministic networks and the more flexible probabilistic networks. Our results confirm that power-law and log-normal models best describe degree distributions for both probabilistic and deterministic networks. Moreover, the inverse correlation of degrees of neighboring nodes shows that, in probabilistic networks, nodes with large number of interactions prefer to interact with those with small number of interactions more frequently than expected. We also show that probabilistic networks are more robust for node-degree distribution computation than the deterministic ones. Availability: all the data sets used, the so- tware implemented and the alignments found in this paper are available at >http://bioinformatics.cise.ufl.edu/projects/probNet/.
  • Keywords
    biochemistry; molecular biophysics; polynomials; probability; proteins; topology; PPI networks; alternative interaction topologies; biological interactions; biological networks; classical deterministic networks; deterministic networks; flexible probabilistic networks; joint-degree distributions; log-normal models; mathematical model; node pairs; node-degree distribution computation; polynomial time; power-law models; probabilistic biological network topology; protein-protein interaction networks; Joints; Mathematical model; Maximum likelihood estimation; Network topology; Probabilistic logic; Random variables; Probabilistic biological networks; degree distribution; network topology; random graphs;
  • fLanguage
    English
  • Journal_Title
    Computational Biology and Bioinformatics, IEEE/ACM Transactions on
  • Publisher
    ieee
  • ISSN
    1545-5963
  • Type

    jour

  • DOI
    10.1109/TCBB.2013.108
  • Filename
    6594743