Pages that link to "Item:Q2384782"

The following pages link to Algorithmic and complexity issues of three clustering methods in microarray data analysis (Q2384782):

Displaying 9 items.

• Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis (Q418747) (← links)
• A tutorial on computational cluster analysis with applications to pattern discovery in microarray data (Q942996) (← links)
• Recovering all generalized order-preserving submatrices: new exact formulations and algorithms (Q1639243) (← links)
• On the complexity of finding emerging patterns (Q1781987) (← links)
• Clustering methods in microarrays (Q2568553) (← links)
• Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
• Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems (Q2933649) (← links)
• Inapproximability of Maximum Weighted Edge Biclique and Its Applications (Q3502654) (← links)
• Parameterized Algorithms for Maximum Edge Biclique and Related Problems (Q4632171) (← links)