Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2649387.2660830acmconferencesArticle/Chapter ViewAbstractPublication PagesbcbConference Proceedingsconference-collections
research-article

A novel context-sensitive random walk model for estimating node correspondence between two biological networks

Published: 20 September 2014 Publication History

Abstract

In this work, we propose a novel context-sensitive random walk model to accurately estimate the node correspondence between two biological networks. We adopt a Markov random walk model that performs a simultaneous walk on two networks. At each step, the random walker examines its neighbors and performs a context-sensitive walk in the following step. More specifically, if there are similar node pairs among the neighbors, the random walker performs a simultaneous walk on both networks. Otherwise, it performs an individual walk on one of the networks. Based on this random walk model, we assume that random walker more frequently visits node pairs with higher correspondence in the long run. Then, we can estimate the node correspondence score by computing the steady state distribution that reflects the long-term behavior of the random walker. We show that the proposed method can accurately predict the correspondence between proteins in different protein-protein interaction (PPI) networks, which implies that our context-sensitive random walker can provide an effective framework for the comparative analysis of large-scale biological networks.

Index Terms

  1. A novel context-sensitive random walk model for estimating node correspondence between two biological networks

          Recommendations

          Comments

          Please enable JavaScript to view thecomments powered by Disqus.

          Information & Contributors

          Information

          Published In

          cover image ACM Conferences
          BCB '14: Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics
          September 2014
          851 pages
          ISBN:9781450328944
          DOI:10.1145/2649387
          • General Chairs:
          • Pierre Baldi,
          • Wei Wang
          Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

          Sponsors

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          Published: 20 September 2014

          Check for updates

          Author Tags

          1. biological network alignment
          2. pair-HMM (hidden Markov model)
          3. random walk

          Qualifiers

          • Research-article

          Conference

          BCB '14
          Sponsor:
          BCB '14: ACM-BCB '14
          September 20 - 23, 2014
          California, Newport Beach

          Acceptance Rates

          Overall Acceptance Rate 254 of 885 submissions, 29%

          Contributors

          Other Metrics

          Bibliometrics & Citations

          Bibliometrics

          Article Metrics

          • 0
            Total Citations
          • 0
            Total Downloads
          • Downloads (Last 12 months)0
          • Downloads (Last 6 weeks)0
          Reflects downloads up to 24 Nov 2024

          Other Metrics

          Citations

          View Options

          Login options

          View options

          Media

          Figures

          Other

          Tables

          Share

          Share

          Share this Publication link

          Share on social media