Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/3042
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSingh, A.-
dc.contributor.authorNagrare, A.-
dc.contributor.authorSrikanth, P.-
dc.contributor.authorKumar, D.-
dc.contributor.authorDwith, C.-
dc.date.accessioned2025-01-31T10:29:34Z-
dc.date.available2025-01-31T10:29:34Z-
dc.date.issued2011-07-
dc.identifier.citation10.1109/PACCS.2011.5990194en_US
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/3042-
dc.descriptionNITWen_US
dc.description.abstractIn the past years, microarray technologies have become a central tool in biological research. The extraction or identification of gene groups with similar expression pattern plays an important role in the analysis of genes. Besides traditional clustering methods, biclustering is also being used to analyze biological datasets due to its ability to group both genes across conditions simultaneously. The paper presents a comparison of advanced with the traditional tools for biological data extraction. This paper compares different clustering and biclustering approaches used to analyze DLBCL (diffuse large B-cell lymphoma) microarray dataset. The algorithms were compared on the grounds of enrichment values with support from runtime analysis. Typical annotations for the analyzed list of genes can be well understood using the BicAT toolbox. The paper explains in detail the intellects affecting the enrichment values, leading to the best technique for the dataset mentioned above.en_US
dc.language.isoenen_US
dc.publisher2011 Third Pacific-Asia Conference on Circuits, Communications and System (PACCS)en_US
dc.subjectClustering algorithmsen_US
dc.subjectAlgorithm design and analysisen_US
dc.titleA Comparison of Biclustering with Clustering Algorithmsen_US
dc.typeOtheren_US
Appears in Collections:Electrical Engineering

Files in This Item:
File Description SizeFormat 
A_Comparison_of_Biclustering_with_Clustering_Algorithms.pdf260 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.