Domination based classification algorithms for the controllability analysis of biological interaction networks

Deciding the size of a minimum dominating set is a classic NP-complete problem. It has found increasing utility as the basis for classifying vertices in networks derived from protein–protein, noncoding RNA, metabolic, and other biological interaction data. In this context it can be helpful, for exam...

Descripción completa

Detalles Bibliográficos
Autores principales: Grady, Stephen K., Abu-Khzam, Faisal N., Hagan, Ronald D., Shams, Hesam, Langston, Michael A.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group UK 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9279401/
https://www.ncbi.nlm.nih.gov/pubmed/35831440
http://dx.doi.org/10.1038/s41598-022-15464-4

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9279401/
https://www.ncbi.nlm.nih.gov/pubmed/35831440
http://dx.doi.org/10.1038/s41598-022-15464-4

Ejemplares similares