Constraint‐based models for dominating protein interaction networks

Abstract The minimum dominating set (MDSet) comprises the smallest number of graph nodes, where other graph nodes are connected with at least one MDSet node. The MDSet has been successfully applied to extract proteins that control protein–protein interaction (PPI) networks and to reveal the correlat...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Adel A. Alofairi, Emad Mabrouk, Ibrahim E. Elsemman
Formato: article
Lenguaje:EN
Publicado: Wiley 2021
Materias:
Acceso en línea:https://doaj.org/article/3062903744924e19947075cfe7050207
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:doaj.org-article:3062903744924e19947075cfe7050207
record_format dspace
spelling oai:doaj.org-article:3062903744924e19947075cfe70502072021-11-05T12:35:39ZConstraint‐based models for dominating protein interaction networks1751-88571751-884910.1049/syb2.12021https://doaj.org/article/3062903744924e19947075cfe70502072021-09-01T00:00:00Zhttps://doi.org/10.1049/syb2.12021https://doaj.org/toc/1751-8849https://doaj.org/toc/1751-8857Abstract The minimum dominating set (MDSet) comprises the smallest number of graph nodes, where other graph nodes are connected with at least one MDSet node. The MDSet has been successfully applied to extract proteins that control protein–protein interaction (PPI) networks and to reveal the correlation between structural analysis and biological functions. Although the PPI network contains many MDSets, the identification of multiple MDSets is an NP‐complete problem, and it is difficult to determine the best MDSets, enriched with biological functions. Therefore, the MDSet model needs to be further expanded and validated to find constrained solutions that differ from those generated by the traditional models. Moreover, by identifying the critical set of the network, the set of nodes common to all MDSets can be time‐consuming. Herein, the authors adopted the minimisation of metabolic adjustment (MOMA) algorithm to develop a new framework, called maximisation of interaction adjustment (MOIA). In MOIA, they provide three models; the first one generates two MDSets with a minimum number of shared proteins, the second model generates constrained multiple MDSets (k‐MDSets), and the third model generates user‐defined MDSets, containing the maximum number of essential genes and/or other important genes of the PPI network. In practice, these models significantly reduce the cost of finding the critical set and classifying the graph nodes. Herein, the authors termed the critical set as the k‐critical set, where k is the number of MDSets generated by the proposed model. Then, they defined a new set of proteins called the (k−1)‐critical set, where each node belongs to (k−1) MDSets. This set has been shown to be as important as the k‐critical set and contains many essential genes, transcription factors, and protein kinases as the k‐critical set. The (k−1)‐critical set can be used to extend the search for drug target proteins. Based on the performance of the MOIA models, the authors believe the proposed methods contribute to answering key questions about the MDSets of PPI networks, and their results and analysis can be extended to other network types.Adel A. AlofairiEmad MabroukIbrahim E. ElsemmanWileyarticleBiology (General)QH301-705.5ENIET Systems Biology, Vol 15, Iss 5, Pp 148-162 (2021)
institution DOAJ
collection DOAJ
language EN
topic Biology (General)
QH301-705.5
spellingShingle Biology (General)
QH301-705.5
Adel A. Alofairi
Emad Mabrouk
Ibrahim E. Elsemman
Constraint‐based models for dominating protein interaction networks
description Abstract The minimum dominating set (MDSet) comprises the smallest number of graph nodes, where other graph nodes are connected with at least one MDSet node. The MDSet has been successfully applied to extract proteins that control protein–protein interaction (PPI) networks and to reveal the correlation between structural analysis and biological functions. Although the PPI network contains many MDSets, the identification of multiple MDSets is an NP‐complete problem, and it is difficult to determine the best MDSets, enriched with biological functions. Therefore, the MDSet model needs to be further expanded and validated to find constrained solutions that differ from those generated by the traditional models. Moreover, by identifying the critical set of the network, the set of nodes common to all MDSets can be time‐consuming. Herein, the authors adopted the minimisation of metabolic adjustment (MOMA) algorithm to develop a new framework, called maximisation of interaction adjustment (MOIA). In MOIA, they provide three models; the first one generates two MDSets with a minimum number of shared proteins, the second model generates constrained multiple MDSets (k‐MDSets), and the third model generates user‐defined MDSets, containing the maximum number of essential genes and/or other important genes of the PPI network. In practice, these models significantly reduce the cost of finding the critical set and classifying the graph nodes. Herein, the authors termed the critical set as the k‐critical set, where k is the number of MDSets generated by the proposed model. Then, they defined a new set of proteins called the (k−1)‐critical set, where each node belongs to (k−1) MDSets. This set has been shown to be as important as the k‐critical set and contains many essential genes, transcription factors, and protein kinases as the k‐critical set. The (k−1)‐critical set can be used to extend the search for drug target proteins. Based on the performance of the MOIA models, the authors believe the proposed methods contribute to answering key questions about the MDSets of PPI networks, and their results and analysis can be extended to other network types.
format article
author Adel A. Alofairi
Emad Mabrouk
Ibrahim E. Elsemman
author_facet Adel A. Alofairi
Emad Mabrouk
Ibrahim E. Elsemman
author_sort Adel A. Alofairi
title Constraint‐based models for dominating protein interaction networks
title_short Constraint‐based models for dominating protein interaction networks
title_full Constraint‐based models for dominating protein interaction networks
title_fullStr Constraint‐based models for dominating protein interaction networks
title_full_unstemmed Constraint‐based models for dominating protein interaction networks
title_sort constraint‐based models for dominating protein interaction networks
publisher Wiley
publishDate 2021
url https://doaj.org/article/3062903744924e19947075cfe7050207
work_keys_str_mv AT adelaalofairi constraintbasedmodelsfordominatingproteininteractionnetworks
AT emadmabrouk constraintbasedmodelsfordominatingproteininteractionnetworks
AT ibrahimeelsemman constraintbasedmodelsfordominatingproteininteractionnetworks
_version_ 1718444279981932544