Show simple item record

dc.contributor.authorCheng, Kin-Onen_US
dc.contributor.authorLaw, Ngai-Fongen_US
dc.contributor.authorSiu, Wan-Chien_US
dc.contributor.authorLiew, Alan Wee-Chungen_US
dc.date.accessioned2017-05-03T15:20:43Z
dc.date.available2017-05-03T15:20:43Z
dc.date.issued2008en_US
dc.date.modified2009-02-11T08:48:42Z
dc.identifier.issn1471-2105en_US
dc.identifier.doi10.1186/1471-2105-9-210en_AU
dc.identifier.urihttp://hdl.handle.net/10072/21274
dc.description.abstractBackground: The DNA microarray technology allows the measurement of expression levels of thousands of genes under tens/hundreds of different conditions. In microarray data, genes with similar functions usually co-express under certain conditions only . Thus, biclustering which clusters genes and conditions simultaneously is preferred over the traditional clustering technique in discovering these coherent genes. Various biclustering algorithms have been developed using different bicluster formulations. Unfortunately, many useful formulations result in NP-complete problems. In this article, we investigate an efficient method for identifying a popular type of biclusters called additive model. Furthermore, parallel coordinate (PC) plots are used for bicluster visualization and analysis. Results: We develop a novel and efficient biclustering algorithm which can be regarded as a greedy version of an existing algorithm known as pCluster algorithm. By relaxing the constraint in homogeneity, the proposed algorithm has polynomial-time complexity in the worst case instead of exponential-time complexity as in the pCluster algorithm. Experiments on artificial datasets verify that our algorithm can identify both additive-related and multiplicative-related biclusters in the presence of overlap and noise. Biologically significant biclusters have been validated on the yeast cell-cycle expression dataset using Gene Ontology annotations. Comparative study shows that the proposed approach outperforms several existing biclustering algorithms. We also provide an interactive exploratory tool based on PC plot visualization for determining the parameters of our biclustering algorithm. Conclusions: We have proposed a novel biclustering algorithm which works with PC plots for an interactive exploratory analysis of gene expression data. Experiments show that the biclustering algorithm is efficient and is capable of detecting co-regulated genes. The interactive analysis enables an optimum parameter determination in the biclustering algorithm so as to achieve the best result. In future, we will modify the proposed algorithm for other bicluster models such as the coherent evolution model.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.format.extent906588 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherBioMed Centralen_US
dc.publisher.placeUnited Kingdomen_US
dc.publisher.urihttp://www.biomedcentral.com/bmcbioinformatics/en_AU
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofpagefrom1en_US
dc.relation.ispartofpageto28en_US
dc.relation.ispartofissue210en_US
dc.relation.ispartofjournalBMC Bioinformaticsen_US
dc.relation.ispartofvolume9en_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchcode270201en_US
dc.subject.fieldofresearchcode280207en_US
dc.titleIdentification of coherent patterns in gene expression data using an efficient biclustering algorithm and parallel coordinate visualizationen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
dcterms.licensehttp://creativecommons.org/licenses/by/2.0en_US
gro.rights.copyrightCopyright 2008 Cheng et al; licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.en_AU
gro.date.issued2008
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record