Cargando…
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...
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: | |
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 |
Ejemplares similares
-
Molecular Subtyping and Outlier Detection in Human Disease Using the Paraclique Algorithm
por: Hagan, Ronald D., et al.
Publicado: (2021) -
Dominating Biological Networks
por: Milenković, Tijana, et al.
Publicado: (2011) -
Graphery: interactive tutorials for biological network algorithms
por: Zeng, Heyuan, et al.
Publicado: (2021) -
A robustness metric for biological data clustering algorithms
por: Lu, Yuping, et al.
Publicado: (2019) -
Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks
por: Wong, Renata, et al.
Publicado: (2023)