NDLI: Biclustering gene expression datasets

Content Provider	IEEE Xplore Digital Library
Author	Ismail, I.H. Kamal, A.H.
Copyright Year	2010
Description	Author affiliation: Computer Science Department, Cairo University, Cairo State, Egypt (Kamal, A.H.) \|\| Computer Science Department, Zagazig University, Zagazig, Sharkia State, Egypt (Ismail, I.H.)
Abstract	Many techniques have been developed to solve biclustering gene expression datasets problem by minimizing the crossings in the input matrices like cHawk [1] and Bimax [9]. The usage of local searching techniques — in the step of Crossing Minimization (CM) — causes some limitations that affect the accuracy of the obtained biclusters. In this paper, Crossing Minimization Biclustering Algorithm (CMBA) is proposed that deals with this issue. CMBA algorithm consists of two main steps: Crossing Minimization and biclusters Identification. In the former step, two global search techniques: Tabu Search (TS) and Greedy Randomized Adaptive Search Procedure (GRASP) are investigated. While identification step, the Mean Squared Residue (MSR) is used as a measurement for the similarity in the input data. The results show that the CMBA algorithm is competitive to other heuristic techniques. Also, CMBA is able to improve the accuracy for both the low density matrices and the high density matrices. Also, using the MSR approach makes CMBA competitive to well-known C&C algorithm [6].
Starting Page	1
Ending Page	8
File Size	457080
Page Count	8
File Format	PDF
ISBN	9781424458288
e-ISBN	9781424458288
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-03-28
Publisher Place	Egypt
Access Restriction	Subscribed
Rights Holder	Cairo University
Subject Keyword	Algorithm design and analysis Minimization methods Gene Expression Biclustering Mean Squared Residue Displays Tabu Search Partitioning algorithms Gene expression Computer science Search methods Clustering algorithms Biological processes Bipartite graph Crossing Minimization
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

cHawk: An Efficient Biclustering Algorithm based on Bipartite Graph Crossing Minimization

cHawk: An Efficient Biclustering Algorithm based on Bipartite Graph Crossing Minimization

BiFree: An Efficient Biclustering Technique for Gene Expression Data Using Two Layer Free Weighted Bipartite Graph Crossing Minimization

Rough Overlapping Biclustering of Gene Expression Data

Mean Squared Residue Based Biclustering Algorithms for the Analysis of Gene Expression Data

Evolving coherent and non-trivial biclusters from gene expression data: An evolutionary approach

Bicross: a biclustering technique for gene expression data using one layer fixed weighted bipartite graph crossing minimization.

Biclustering of gene expression data using Greedy Randomized Adaptive Search Procedure

BiCross : A Biclustering Technique for Gene Expression Data using One Layer Fixed Weighted Bipartite Graph Crossing Minimization

Biclustering gene expression datasets — an efficient technique

Similar Documents

cHawk: An Efficient Biclustering Algorithm based on Bipartite Graph Crossing Minimization

cHawk: An Efficient Biclustering Algorithm based on Bipartite Graph Crossing Minimization

BiFree: An Efficient Biclustering Technique for Gene Expression Data Using Two Layer Free Weighted Bipartite Graph Crossing Minimization

Rough Overlapping Biclustering of Gene Expression Data

Mean Squared Residue Based Biclustering Algorithms for the Analysis of Gene Expression Data

Evolving coherent and non-trivial biclusters from gene expression data: An evolutionary approach

Bicross: a biclustering technique for gene expression data using one layer fixed weighted bipartite graph crossing minimization.

Biclustering of gene expression data using Greedy Randomized Adaptive Search Procedure

BiCross : A Biclustering Technique for Gene Expression Data using One Layer Fixed Weighted Bipartite Graph Crossing Minimization

Biclustering gene expression datasets — an efficient technique