- Title
- On the complexity and completeness of robust biclustering algorithm
- Creator
- Ibrahim, Muhammad; Noman, Nasimul; Iba, Hitoshi
- Relation
- 4th International Conference on Bioinformatics and Biomedical Engineering (iCBBE 2010). Proceedings of the 4th International Conference on Bioinformatics and Biomedical Engineering (Chengdu, China 18-20 June, 2010)
- Publisher Link
- http://dx.doi.org/10.1109/ICBBE.2010.5518207
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Resource Type
- conference paper
- Date
- 2010
- Description
- A biclustering algorithm named ROBA has been used in a number of recent works. We present a time and space efficient implementation of ROBA that reduces the time and space complexity by an order of L where L is the number of distinct values present in the data. Our implementation runs almost 11 times faster than the existing implementation on Yeast gene expression dataset. We also improve ROBA and then use it to present an iterative algorithm that can find all perfect biclusters with constant values, constant values on rows and constant values on columns. Though our algorithm may take exponential time in the worst case, we use some subtle observations to reduce computational time and space. Experimental result reveals that our algorithm runs in reasonable time on Yeast gene expression dataset and finds almost 10 times more biclusters than ROBA.
- Subject
- biclustering; robust biclustering algorithm; gene expression data
- Identifier
- http://hdl.handle.net/1959.13/1057688
- Identifier
- uon:16236
- Identifier
- ISBN:9781424447138
- Language
- eng
- Reviewed
- Hits: 2195
- Visitors: 2149
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|