1.
Advanced clique algorithms for protein product graphsJanez Konc,
Dušanka Janežič, 2025, izvirni znanstveni članek
Opis: In this paper, we give a comprehensive overview of the development of clique algo-rithms and their use for drug design based on the search for cliques in protein productgraphs. The maximum clique problem is a computational problem of finding largest sub-sets of vertices in a graph that are all pairwise adjacent. A related problem is the maximumweight clique problem and the highest weight k-clique problem, which both extend the al-gorithm to weighted graphs. The review covers our developed algorithms, starting with ourimproved branch-and-bound algorithm for finding maximum cliques in undirected graphsfrom 2007 up to the recent developments of algorithms for weighted graphs in 2024. Weshow the application of these algorithms to early stages of drug discovery, in particular toprotein binding site detection based on protein similarity search in large protein databasesand to protein-ligand molecular docking.
Ključne besede: cliques, protein product graphs, applications
Objavljeno v RUP: 08.08.2025; Ogledov: 375; Prenosov: 13
Celotno besedilo (506,72 KB)
Gradivo ima več datotek! Več...
