Pages that link to "Item:Q2576442"

The following pages link to Clustering of microarray data via clique partitioning (Q2576442):

Displaying 35 items.

• A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
• Clustering of high throughput gene expression data (Q339649) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Orbitopal fixing (Q408377) (← links)
• Identification of cancer-associated gene clusters and genes via clustering penalization (Q440026) (← links)
• Exact algorithms for cluster editing: Evaluation and experiments (Q534775) (← links)
• Combining gene expression profiles and drug activity patterns analysis: a relational clustering approach (Q655192) (← links)
• Data clustering and visualization via energy minimization (Q691926) (← links)
• Analysing microarray expression data through effective clustering (Q903620) (← links)
• A tutorial on computational cluster analysis with applications to pattern discovery in microarray data (Q942996) (← links)
• Median correlation for the analysis of gene expression data (Q947418) (← links)
• A spectral clustering method for microarray data (Q957180) (← links)
• Amalgamation of partitions from multiple segmentation bases: a comparison of non-model-based and model-based methods (Q1037693) (← links)
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
• Rival penalized competitive learning (RPCL): A topology-determining algorithm for analyzing gene expression data. (Q1425248) (← links)
• Cluster structure inference based on clustering stability with applications to microarray data analysis (Q1773694) (← links)
• Lagrangian relaxation and pegging test for the clique partitioning problem (Q2256778) (← links)
• Redundant constraints in the standard formulation for the clique partitioning problem (Q2257087) (← links)
• Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
• Algorithmic and complexity issues of three clustering methods in microarray data analysis (Q2384782) (← links)
• New bounds and constraint propagation techniques for the clique partitioning problem (Q2446845) (← links)
• An effective modeling and solution approach for the generalized independent set problem (Q2458909) (← links)
• GeneMCL in microarray analysis (Q2490492) (← links)
• Clustering methods in microarrays (Q2568553) (← links)
• Clustering Microarray Data: Theoretical and Practical Issues (Q3167858) (← links)
• Exact Algorithms for Cluster Editing: Evaluation and Experiments (Q3506417) (← links)
• Weighted clustering of called array CGH data (Q3526177) (← links)
• Applications and Computational Advances for Solving the QUBO Model (Q5050142) (← links)
• Integrating Functional Knowledge during Sample Clustering for Microarray Data using Unsupervised Decision Trees (Q5122914) (← links)
• Cluster Editing (Q5326357) (← links)
• Clique Partitioning for Clustering: A Comparison with<i>K</i>-Means and Latent Class Analysis (Q5451111) (← links)
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models (Q5918755) (← links)
• On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
• Fixed set search applied to the clique partitioning problem (Q6112737) (← links)
• \texttt{CP-Lib}: benchmark instances of the clique partitioning problem (Q6548518) (← links)