Name
Abstract | ||
|---|---|---|
Biclustering algorithm is used to find local patterns as an important tool in the analysis of gene expression data. However, most of the biclusters found by existing biclustering algorithms consist of non-continuous columns. It is not suitable for time series gene expression data, which has not been extensively studied. This paper presents an efficient exact algorithm to search contiguous column coherent evolution biclusters in time-series data. The first step of the algorithm is to transform the original matrix into the difference matrix, then starting from the column pattern consisting of continuous k columns, gradually obtain longer patterns composed of more columns by using the prefix tree and nodes-update-strategy to improve the efficiency of the algorithm. Experimental results on real data show that the algorithm can find biclusters with statistically significance and strong biological relevance. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/CIS.2014.164 | CIS |
Keywords | Field | DocType |
NETWORKS | Time series,Algorithm design,Exact algorithm,Computer science,Matrix (mathematics),Matrix difference equation,Support vector machine,Algorithm,Artificial intelligence,Biclustering,Trie,Machine learning | Conference |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yun Xue | 1 | 6 | 5.30 |
| Zhengling Liao | 2 | 5 | 3.44 |
| Meihang Li | 3 | 8 | 3.83 |
| Jie Luo | 4 | 706 | 73.44 |
| Xiao-Hui Hu | 5 | 10 | 5.55 |
| Guiyin Luo | 6 | 0 | 0.34 |
| Wen-Sheng Chen | 7 | 10 | 1.38 |