Pages that link to "Item:Q1274603"
From MaRDI portal
The following pages link to Classifying molecular sequences using a linkage graph with their pairwise similarities (Q1274603):
Displaying 14 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Graph clustering (Q458448) (← links)
- Finding weighted \(k\)-truss communities in large networks (Q778465) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- An efficient technique for superfamily classification of amino acid sequences: feature extraction, fuzzy clustering and prototype selection (Q1776494) (← links)
- Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
- Finding influential communities in networks with multiple influence types (Q2056381) (← links)
- Transfer distance between partitions (Q2442768) (← links)
- Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques (Q2490599) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Online summarization of dynamic graphs using subjective interestingness for sequential data (Q2659275) (← links)
- A Game-Theoretic Approach to Graph Clustering (Q2940545) (← links)
- On the parameterized complexity of non-hereditary relaxations of clique (Q6549685) (← links)
