Random walk biclustering for microarray data

DOI10.1016/J.INS.2007.11.007zbMATH Open1134.68052OpenAlexW1989504887MaRDI QIDQ2476780FDOQ2476780

Authors: Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti 

Publication date: 12 March 2008

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2007.11.007

Recommendations

• Hierarchical mixture models for biclustering in microarray data
• Analysis of biclusters with applications to gene expression data
• Combinatorial Pattern Matching

zbMATH Keywords

biclusteringlocal searchmicroarray data

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Feature selection for consistent biclustering via fractional 0-1 programming
• Biclustering in data mining
• Cluster validation techniques for genome expression data

Cited In (10)

• A probabilistic relaxation labeling framework for reducing the noise effect in geometric biclustering of gene expression data
• MIB: using mutual information for biclustering gene expression data
• A fuzzy biclustering algorithm for single cluster
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
• Improved biclustering on expression data through overlapping control
• A new geometric biclustering algorithm based on the Hough transform for analysis of large-scale microarray data
• Combinatorial Pattern Matching
• Finding Additive Biclusters with Random Background
• Search heuristics for module identification from biological high-thoughput data
• Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction

This page was built for publication: Random walk biclustering for microarray data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476780)