Cargando…
Densest subgraph-based methods for protein-protein interaction hot spot prediction
BACKGROUND: Hot spots play an important role in protein binding analysis. The residue interaction network is a key point in hot spot prediction, and several graph theory-based methods have been proposed to detect hot spots. Although the existing methods can yield some interesting residues by network...
Autores principales: | Li, Ruiming, Lee, Jung-Yu, Yang, Jinn-Moon, Akutsu, Tatsuya |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9623998/ https://www.ncbi.nlm.nih.gov/pubmed/36316653 http://dx.doi.org/10.1186/s12859-022-04996-1 |
Ejemplares similares
-
Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem
por: Guo, Chuan-Hao, et al.
Publicado: (2019) -
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks
por: Dondi, Riccardo, et al.
Publicado: (2021) -
On the Densest Packing of Polycylinders in Any Dimension
por: Kusner, Wöden
Publicado: (2016) -
Protein complex prediction based on k-connected subgraphs in protein interaction network
por: Habibi, Mahnaz, et al.
Publicado: (2010) -
Hot spot prediction in protein-protein interactions by an ensemble system
por: Liu, Quanya, et al.
Publicado: (2018)