Maximum Clique Algorithm statistics

info info

Citations per year

Number of citations per year for the bioinformatics software tool Maximum Clique Algorithm

Tool usage distribution map

This map represents all the scientific publications referring to Maximum Clique Algorithm per scientific context
info info

Associated diseases


Popular tool citations

chevron_left Protein structure comparison chevron_right
Want to access the full stats & trends on this tool?

Maximum Clique Algorithm specifications


Unique identifier OMICS_24926
Name Maximum Clique Algorithm
Alternative name MaxCliqueDyn
Software type Application/Script
Interface Command line interface
Restrictions to use None
Operating system Unix/Linux
Programming languages C++
License GNU General Public License version 3.0
Computer skills Advanced
Stability Stable
Source code URL
Maintained Yes




No version available



  • person_outline Dusanka Janezic

Publication for Maximum Clique Algorithm

Maximum Clique Algorithm citations


Modular Bayesian Networks with Low Power Wearable Sensors for Recognizing Eating Activities

PMCID: 5751632
PMID: 29232937
DOI: 10.3390/s17122877

[…] BN to O(k3nk+wn2+(wrwrw)n); by limiting k to 2 and minimizing the w, where n is the number of nodes, k is the maximum number of parents, r is the maximum number of values for each node, and w is the maximum clique. Algorithm 1. Learning algorithm for the CPT.for∀D,// D is the input data increment numOfData by 1; C :=class of D;for i=1 to n(I) do if C includes Ii then     increment num(Ii) by 1;   […]


A review of parameters and heuristics for guiding metabolic pathfinding

J Cheminform
PMCID: 5602787
PMID: 29086092
DOI: 10.1186/s13321-017-0239-6

[…] ructure between the graph representations of two compounds, was used for building the KEGG RPAIR database utilized by many pathfinding algorithms (Fig. a). SIMCOMP uses a variant of the Bron-Kerbosch maximum clique algorithm [] to identify the maximum common substructure of two compounds.Fig. 3 Unlike chemical fingerprints, where a pre-determined set of chemical characteristics are used to compare […]


Ligand based virtual screening interface between PyMOL and LiSiCA

J Cheminform
PMCID: 5013575
PMID: 27606012
DOI: 10.1186/s13321-016-0157-z

[…] l-molecule databases with immediate subsequent visualization of predicted ligands. The developed plugin represents an interface between PyMOL and LiSiCA, an LBVS software based on a graph theoretical maximum clique algorithm ( [, ]. The main purpose of this interface is to enable visualization of large amounts of data returned from LiSiCA’s output within the preferred […]


Modeling enzyme ligand binding in drug discovery

J Cheminform
PMCID: 4594084
PMID: 26457119
DOI: 10.1186/s13321-015-0096-0

[…] ased drug design.Based on the idea that proteins with similar local binding sites perform similar function, an algorithm ProBiS and its corresponding web server [, ] was developed. ProBiS uses a fast maximum clique algorithm [] to compare a query protein to members of a database of 3D protein structures and detects with sub-residue precision structurally similar binding sites as patterns of physio […]


Structure Based Function Prediction of Uncharacterized Protein Using Binding Sites Comparison

PLoS Comput Biol
PMCID: 3828134
PMID: 24244144
DOI: 10.1371/journal.pcbi.1003341

[…] respective of sequence or fold similarity of proteins –. The algorithm, ProBiS (Protein Binding Sites) compares protein binding sites represented as protein graphs in a pairwise fashion using a fast maximum clique algorithm on protein product graphs, and finds sets of residues that are physicochemically and geometrically related. Querying a target binding site, or target protein structure, again […]


The taming of an impossible child: a standardized all in approach to the phylogeny of Hymenoptera using public database sequences

BMC Biol
PMCID: 3173391
PMID: 21851592
DOI: 10.1186/1741-7007-9-55

[…] species in which the sequences of all species overlap in at least 100 nucleotide or amino acid positions [IX]. This was done with the aid of the script minimum_sequence_overlap. The script applies a maximum clique algorithm. Generally, a maximum clique search is a way to find the largest group of items that fulfill a certain pairwise criterion. (See Additional file for a short introduction to ma […]

Want to access the full list of citations?
Maximum Clique Algorithm institution(s)
National Institute of Chemistry, Ljubljana, Slovenia
Maximum Clique Algorithm funding source(s)
Supported by grants P1-0002 of the Ministry of Higher Education, Science, and Technology of Slovenia.

Maximum Clique Algorithm reviews

star_border star_border star_border star_border star_border
star star star star star

Be the first to review Maximum Clique Algorithm