Querying pathways in protein interaction networks based on hidden Markov models.
High-throughput techniques for measuring protein interactions have enabled the systematic study of complex protein networks. Comparing the networks of different organisms and identifying their common substructures can lead to a better understanding of the regulatory mechanisms underlying various cellular functions. To facilitate such comparisons, we present an efficient framework based on hidden Markov models (HMMs) that can be used for finding homologous pathways in a network of interest. Given a query path, our method identifies the top k matching paths in the network, which may contain any number of consecutive insertions and deletions. We demonstrate that our method is able to identify biologically significant pathways in protein interaction networks obtained from the DIP database, and the retrieved paths are closer to the curated pathways in the KEGG database when compared to the results from previous approaches. Unlike most existing algorithms that suffer from exponential time complexity, our algorithm has a polynomial complexity that grows linearly with the query size. This enables the search for very long paths with more than 10 proteins within a few minutes on a desktop computer. A software program implementing the algorithm is available upon request from the authors.
Qian
Xiaoning
X
Department of Electrical & Computer Engineering, Texas A&M University, College Station, TX 77843-3128, USA.
Sze
Sing-Hoi
SH
Yoon
Byung-Jun
BJ
D000465:Algorithms; D000818:Animals; D003198:Computer Simulation; D016208:Databases, Factual; D004331:Drosophila melanogaster; D006801:Humans; D008390:Markov Chains; D025941:Protein Interaction Mapping; D011506:Proteins / Q000737:chemistry / Q000378:metabolism; D015203:Reproducibility of Results; D015398:Signal Transduction; D012984:Software
D011506:Proteins