A Combinatoric biclustering algorithm

Authors:
Ekaterina Nosova;Giancarlo Raiconi;Roberto Tagliaferri
Affiliations:
DMI, University of Salerno, Fisciano (Salerno), 84084, Italia;DMI, University of Salerno, Fisciano (Salerno), 84084, Italia;DMI, University of Salerno, Fisciano (Salerno), 84084, Italia
Venue:
Proceedings of the 2011 conference on Neural Nets WIRN10: Proceedings of the 20th Italian Workshop on Neural Nets
Year:
2011

Citing 4
Cited 0

Biclustering of Expression Data

Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Consensus algorithms for the generation of all maximal bicliques

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Graph Theory With Applications

Graph Theory With Applications
A systematic comparison and evaluation of biclustering methods for gene expression data

Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The unsupervised analysis of gene expression data plays a very important role in Genetics experiments. That is why a lot of clustering and biclustering techniques have been proposed. Our choice of biclustering methods is motivated by the accuracy in the obtained results and the possibility to find not only rows or columns that provide a partition of the dataset but also rows and columns together. Unfortunately, the experimental data yet contains many inaccuracy and errors, therefore the main task of mathematicians is to find algorithms that permit to analyze this data with maximal precision. In this work, a new biclustering algorithm that permits to find biclusters with an error less than a predefined threshold is presented. The comparison with other known biclustering algorithms is shown.