Abstract
In this work, we present RESQUE, an efficient algorithm for querying large-scale biological networks. The algorithm uses a semi-Markov random walk model to estimate the correspondence scores between nodes across different networks. The target network is iteratively reduced based on the node correspondence scores, which are also iteratively re-estimated for improved accuracy, until the best matching subnetwork emerges. The proposed network querying scheme is computationally efficient, can handle any network query with arbitrary topology, and yields accurate querying results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bruckner, S., Huffner, F., Karp, R.M., Shamir, R., Sharan, R.: Topology-free querying of protein interaction networks. J. Comput. Biol. 17, 237–252 (2010)
Dost, B., Shlomi, T., Gupta, N., Ruppin, E., Bafna, V., Sharan, R.: QNet: A tool for querying protein interaction networks. J. Comput. Biol. 15(7), 913–925 (2008)
Sharan, R., Ideker, T.: Modeling cellular machinery through biological network comparison. Nat. Biotechnol. 24, 427–433 (2006)
Yang, Q., Sze, S.: Path matching and graph matching in biological networks. J. Comput. Biol. 14, 56–67 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sahraeian, S.M.E., Yoon, BJ. (2012). RESQUE: Network Reduction Using Semi-Markov Random Walk Scores for Efficient Querying of Biological Networks (Extended Abstract). In: Chor, B. (eds) Research in Computational Molecular Biology. RECOMB 2012. Lecture Notes in Computer Science(), vol 7262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29627-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-29627-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29626-0
Online ISBN: 978-3-642-29627-7
eBook Packages: Computer ScienceComputer Science (R0)