Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
clique finding
Description:
An algorithmic task in graph theory that seeks complete subgraphs, often as part of optimization, pattern matching, or network analysis.
Related topics:
Complexity and Algorithms in Graphs (12%),
Protein Structure and Dynamics (9%),
Graph Theory and Algorithms (9%),
Metaheuristic Optimization Algorithms Research (8%),
Quantum Computing Algorithms and Architecture (8%)
OpenAlex ID:
keywords/clique-finding
A graph-theoretic algorithm for comparative modeling of protein structure
1998
·
Ram Samudrala
, John Moult
·
Journal of Molecular Biology
·
176
Using Indirect Protein–protein Interactions for Protein Complex Prediction
2008
·
HON NIAN CHUA
, KANG NING
, et al.
·
Journal of Bioinformatics and Computational Biology
·
151
Four classes of perfectly orderable graphs
1987
·
V. Chvátal
, C. T. Hoàng
, et al.
·
Journal of Graph Theory
·
134
A Knowledge-Based Clustering Algorithm Driven by Gene Ontology
2004
·
Jill Cheng
, Melissa Cline
, et al.
·
Journal of Biopharmaceutical Statistics
·
125
A universal programmable Gaussian boson sampler for drug discovery
2023
·
Shang Yu
, Zhi-Peng Zhong
, et al.
·
Nature Computational Science
·
96
PDF
Efficient Combinatorial Optimization Using Quantum Annealing
2018
·
Djidjev, Hristo N.
, Chapuis, Guillaume
, et al.
·
arXiv (Cornell University)
·
73
PDF
Exact combinatorial algorithms and experiments for finding maximum k-plexes
2011
·
Hannes Moser
, Rolf Niedermeier
, et al.
·
Journal of Combinatorial Optimization
·
61
Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
1992
·
Egon Balas
, Jue Xue
·
SIAM Journal on Computing
·
56
Quantum algorithms for subset finding
2003
·
Childs, A M
, Eisenberg, J M
·
CERN Document Server (European Organization for Nuclear Research)
·
54
Using Indirect Protein-protein Interactions for Protein Complex Prediction
2007
·
Hon Nian Chua
, Kang Ning
, et al.
·
IEEE Computational Systems Bioinformatics Conference (CSB)
·
47
A fast and automated solution for accurately resolving protein domain architectures
2010
·
Corin Yeats
, Oliver C. Redfern
, et al.
·
Bioinformatics
·
46
PDF
Applications of graph theory in protein structure identification
2011
·
Yan Yan
, Shenggui Zhang
, et al.
·
Proteome Science
·
41
PDF
Discovery of high-dimensional inclusion dependencies
2004
·
A. Koeller
, E.A. Rundensteiner
·
IEEE International Conference on Data Engineering (ICDE)
·
38
Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding
2004
·
Sing-Hoi Sze
, Songjian Lu
, et al.
·
Lecture notes in computer science
·
37
Finding large cliques in arbitrary graphs by bipartite matching
1996
·
Egon Balas
, William Niehaus
·
DIMACS series in discrete mathematics and theoretical computer science
·
35
On a conjecture of Meyniel
1987
·
C.T Hoàng
·
Journal of Combinatorial Theory Series B
·
33
PDF
jClust: a clustering and visualization toolbox
2009
·
Georgios A. Pavlopoulos
, Charalampos N. Moschopoulos
, et al.
·
Bioinformatics
·
28
PDF
Handling context-sensitivity in protein structures using graph theory: Bona fide prediction
1997
·
Ram Samudrala
, John Moult
·
Proteins Structure Function and Bioinformatics
·
26
Finding cliques using few probes
2019
·
Uriel Feige
, David Gamarnik
, et al.
·
Random Structures and Algorithms
·
17
PDF
A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
1995
·
J. Douglas Carroll
, James E. Corter
·
Journal of Classification
·
17
A self-stabilizing algorithm for finding cliques in distributed systems
2003
·
H. Ishii
, H. Kakugawa
·
IEEE Symposium on Reliable Distributed Systems (SRDS)
·
16
Finding cliques in an undirected graph
1972
·
Coen Bron
, Jagm Kerbosch
, et al.
·
TU/e Research Portal
·
16
A Combinatorial Approach to the Analysis of Differential Gene Expression Data: The Use of Graph Algorithms for Disease Prediction and Screening *
2008
·
Michael A. Langston
, Lan Lin
, et al.
·
15
Redesigning Subgroups in a Personnel Network Based on Dna Computing
·
Ikno Kim
, Don Jyh-fu Jeng
, et al.
·
15
Finding a planted clique by adaptive probing
2020
·
Miklós Z. Rácz
, Benjamin Schiffer
·
Latin American Journal of Probability and Mathematical Statistics
·
14
PDF
Show more works
View as search
Works count:
118
Citation count:
1,830
Year
Topic
Type