Cargando…
Effective Identification of Conserved Pathways in Biological Networks Using Hidden Markov Models
BACKGROUND: The advent of various high-throughput experimental techniques for measuring molecular interactions has enabled the systematic study of biological interactions on a global scale. Since biological processes are carried out by elaborate collaborations of numerous molecules that give rise to...
Autores principales: | , |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2009
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2782142/ https://www.ncbi.nlm.nih.gov/pubmed/19997609 http://dx.doi.org/10.1371/journal.pone.0008070 |
_version_ | 1782174610302697472 |
---|---|
author | Qian, Xiaoning Yoon, Byung-Jun |
author_facet | Qian, Xiaoning Yoon, Byung-Jun |
author_sort | Qian, Xiaoning |
collection | PubMed |
description | BACKGROUND: The advent of various high-throughput experimental techniques for measuring molecular interactions has enabled the systematic study of biological interactions on a global scale. Since biological processes are carried out by elaborate collaborations of numerous molecules that give rise to a complex network of molecular interactions, comparative analysis of these biological networks can bring important insights into the functional organization and regulatory mechanisms of biological systems. METHODOLOGY/PRINCIPAL FINDINGS: In this paper, we present an effective framework for identifying common interaction patterns in the biological networks of different organisms based on hidden Markov models (HMMs). Given two or more networks, our method efficiently finds the top [Image: see text] matching paths in the respective networks, where the matching paths may contain a flexible number of consecutive insertions and deletions. CONCLUSIONS/SIGNIFICANCE: Based on several protein-protein interaction (PPI) networks obtained from the Database of Interacting Proteins (DIP) and other public databases, we demonstrate that our method is able to detect biologically significant pathways that are conserved across different organisms. Our algorithm has a polynomial complexity that grows linearly with the size of the aligned paths. This enables the search for very long paths with more than 10 nodes within a few minutes on a desktop computer. The software program that implements this algorithm is available upon request from the authors. |
format | Text |
id | pubmed-2782142 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2009 |
publisher | Public Library of Science |
record_format | MEDLINE/PubMed |
spelling | pubmed-27821422009-12-08 Effective Identification of Conserved Pathways in Biological Networks Using Hidden Markov Models Qian, Xiaoning Yoon, Byung-Jun PLoS One Research Article BACKGROUND: The advent of various high-throughput experimental techniques for measuring molecular interactions has enabled the systematic study of biological interactions on a global scale. Since biological processes are carried out by elaborate collaborations of numerous molecules that give rise to a complex network of molecular interactions, comparative analysis of these biological networks can bring important insights into the functional organization and regulatory mechanisms of biological systems. METHODOLOGY/PRINCIPAL FINDINGS: In this paper, we present an effective framework for identifying common interaction patterns in the biological networks of different organisms based on hidden Markov models (HMMs). Given two or more networks, our method efficiently finds the top [Image: see text] matching paths in the respective networks, where the matching paths may contain a flexible number of consecutive insertions and deletions. CONCLUSIONS/SIGNIFICANCE: Based on several protein-protein interaction (PPI) networks obtained from the Database of Interacting Proteins (DIP) and other public databases, we demonstrate that our method is able to detect biologically significant pathways that are conserved across different organisms. Our algorithm has a polynomial complexity that grows linearly with the size of the aligned paths. This enables the search for very long paths with more than 10 nodes within a few minutes on a desktop computer. The software program that implements this algorithm is available upon request from the authors. Public Library of Science 2009-12-07 /pmc/articles/PMC2782142/ /pubmed/19997609 http://dx.doi.org/10.1371/journal.pone.0008070 Text en Qian, Yoon. http://creativecommons.org/licenses/by/4.0/ This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are properly credited. |
spellingShingle | Research Article Qian, Xiaoning Yoon, Byung-Jun Effective Identification of Conserved Pathways in Biological Networks Using Hidden Markov Models |
title | Effective Identification of Conserved Pathways in Biological Networks Using Hidden Markov Models |
title_full | Effective Identification of Conserved Pathways in Biological Networks Using Hidden Markov Models |
title_fullStr | Effective Identification of Conserved Pathways in Biological Networks Using Hidden Markov Models |
title_full_unstemmed | Effective Identification of Conserved Pathways in Biological Networks Using Hidden Markov Models |
title_short | Effective Identification of Conserved Pathways in Biological Networks Using Hidden Markov Models |
title_sort | effective identification of conserved pathways in biological networks using hidden markov models |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2782142/ https://www.ncbi.nlm.nih.gov/pubmed/19997609 http://dx.doi.org/10.1371/journal.pone.0008070 |
work_keys_str_mv | AT qianxiaoning effectiveidentificationofconservedpathwaysinbiologicalnetworksusinghiddenmarkovmodels AT yoonbyungjun effectiveidentificationofconservedpathwaysinbiologicalnetworksusinghiddenmarkovmodels |