Identification of promoter regions in genomic sequences by 1-dimensional constraint clustering
暂无分享,去创建一个
[1] R C Durfee,et al. A METHOD OF CLUSTER ANALYSIS. , 1970, Multivariate behavioral research.
[2] Pierre Hansen,et al. NP-hardness of Euclidean sum-of-squares clustering , 2008, Machine Learning.
[3] A W EDWARDS,et al. A METHOD FOR CLUSTER ANALYSIS. , 1965, Biometrics.
[4] F. Sacca. PROBLEMI DI CLUSTERING CON VINCOLI: ALGORITMI E COMPLESSITÀ , 2010 .
[5] J. MacQueen. Some methods for classification and analysis of multivariate observations , 1967 .
[6] Leah Barrera,et al. A high-resolution map of active promoters in the human genome , 2005, Nature.
[7] Anthony K. H. Tung,et al. Constraint-based clustering in large databases , 2001, ICDT.
[8] Shunzhi Zhu,et al. Data clustering with size constraints , 2010, Knowl. Based Syst..
[9] Andrea Vattani. k-means Requires Exponentially Many Iterations Even in the Plane , 2011, Discret. Comput. Geom..
[10] Philipp Bucher,et al. MADAP, a flexible clustering tool for the interpretation of one-dimensional genome annotation data , 2007, Nucleic Acids Res..
[11] Ayhan Demiriz,et al. Constrained K-Means Clustering , 2000 .
[12] Beth Novick. Norm statistics and the complexity of clustering problems , 2009, Discret. Appl. Math..
[13] Meena Mahajan,et al. The Planar k-means Problem is NP-hard I , 2009 .