We present algorithms for time-series gene expression analysis that permit the principled estimation of unobserved time-points, clustering, and dataset alignment. Each expression profile is modeled as a cubic spine (piecewise polynomial) that is estimated from the observed data and every time point influences the overall smooth expression curve. We constrain the spline coefficients of genes in the same class to have similar expression patterns, while also allowing for gene specific parameters. We show that unobserved time-points can be reconstructed using our method with 10-15% less error when compared to previous best methods. Our clustering algorithm operates directly on the continuous representations of gene expression profiles, and we demonstrate that this is particularly effective when applied to non-uniformly sampled data. Our continuous alignment algorithm also avoids difficulties encountered by discrete approaches. In particular, our method allows for control of the number of degrees of freedom of the warp through the specification of parametrized functions, which helps to avoid overfitting. We demonstrate that our algorithm produces stable low-error alignments on real expression data and further show a specific application to yeast knockout data that produces biologically meaningful results.
|Original language||American English|
|Number of pages||10|
|State||Published - 2002|
|Event||RECOMB 2002: Proceedings of the Sixth Annual International Conference on Computational Biology - Washington, DC, United States|
Duration: 18 Apr 2002 → 21 Apr 2002
|Conference||RECOMB 2002: Proceedings of the Sixth Annual International Conference on Computational Biology|
|Period||18/04/02 → 21/04/02|