Abstract

Biclustering, which is simultaneous clustering of columns and rows in data matrix, became an issue when classical clustering algorithms proved not to be good enough to detect similar expressions of genes under subset of conditions. Biclustering algorithms may be also applied to different datasets, such as medical, economical, social networks etc. In this article we explain the concept beneath hybrid biclustering algorithms and present details of propagation-based biclustering, a novel approach for extracting inclusion-maximal gene expression motifs conserved in gene microarray data. We prove that this approach may successfully compete with other well-recognized biclustering algorithms.

Keywords

Cite this article

@article{cai-1804,
  author  = {Patryk Orzechowski and Krzysztof Boryczko},
  title   = {Propagation-Based Biclustering Algorithm for Extracting Inclusion-Maximal Motifs},
  journal = {Computing and Informatics},
  volume  = {35},
  number  = {2},
  pages   = {391--410},
  year    = {2016},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2016/2/propagation-based-biclustering-algorithm-for-extracting-inclusion-maximal-motifs/}
}
Download .bib