Propagation-Based Biclustering Algorithm for Extracting Inclusion-Maximal Motifs
Patryk Orzechowski; AGH University of Science and Technology, Kraków ; Krzysztof Boryczko; AGH University of Science and Technology, Kraków
Computing and Informatics, Tome 34 (2016) no. 4, / Harvested from Computing and Informatics
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.
Publié le : 2016-07-11
Classification:  Theoretical Foundations,  Biclustering, bioinformatics, pattern matching, data mining, microarray gene expression data, conserved gene expression motifs
@article{cai1804,
     author = {Patryk Orzechowski; AGH University of Science and Technology, Krak\'ow and Krzysztof Boryczko; AGH University of Science and Technology, Krak\'ow},
     title = {Propagation-Based Biclustering Algorithm for Extracting Inclusion-Maximal Motifs},
     journal = {Computing and Informatics},
     volume = {34},
     number = {4},
     year = {2016},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai1804}
}
Patryk Orzechowski; AGH University of Science and Technology, Kraków; Krzysztof Boryczko; AGH University of Science and Technology, Kraków. Propagation-Based Biclustering Algorithm for Extracting Inclusion-Maximal Motifs. Computing and Informatics, Tome 34 (2016) no. 4, . http://gdmltest.u-ga.fr/item/cai1804/