Volume 3 Number 10 (Oct. 2008)
Home > Archive > 2008 > Volume 3 Number 10 (Oct. 2008) >
JCP 2008 Vol.3(10): 71-77 ISSN: 1796-203X
doi: 10.4304/jcp.3.10. 71-77

A Parallel Algorithm for Gene Expressing Data Biclustering

LIU Wei1, CHEN Ling2
1Institute of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China
2Department of Computer Science, Yangzhou University, Yangzhou, China


Abstract—Biclustering of the gene expressing data is an important task in bioinformatics. By clustering the gene expressing data obtained under different experimental conditions, function and regulatory elements of the gene sequence can be analyzed and recognized. A parallel biclustering algorithm for gene expressing data is presented. Based on the anti-monotones property of the quality of the data sets with their sizes, the algorithm starts from the data sets containing of all the 2*2 submatrices of the gene expressing data matrix, and gets the final biclusters by gradually adding columns and rows on the data sets. Experimental results show that our algorithm has superiority over other similar algorithms in terms of processing speedup and quality of clustering and efficiency.

Index Terms—bioinformatics, biclustering, gene expression data

[PDF]

Cite: LIU Wei, CHEN Ling, "A Parallel Algorithm for Gene Expressing Data Biclustering," Journal of Computers vol. 3, no. 10, pp. 71-77, 2008.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>