Performance comparison of gene family clustering methods with expert curated gene family data set in Arabidopsis thaliana

被引:4
作者
Yang, Kuan [2 ,3 ]
Zhang, Liqing [1 ,3 ]
机构
[1] Virginia Tech, Dept Comp Sci, Blacksburg, VA 24061 USA
[2] Virginia Tech, Virginia Bioinformat Inst, Blacksburg, VA 24061 USA
[3] Virginia Tech, Program Genet Bioinformat & Computat Biol, Blacksburg, VA 24061 USA
基金
美国国家科学基金会;
关键词
Arabidopsis; complete linkage; gene family; hierarchical clustering algorithm; K-means clustering; single linkage; TribeMCL;
D O I
10.1007/s00425-008-0748-7
中图分类号
Q94 [植物学];
学科分类号
071001 ;
摘要
With the exponential growth of genomics data, the demand for reliable clustering methods is increasing every day. Despite the wide usage of many clustering algorithms, the accuracy of these algorithms has been evaluated mostly on simulated data sets and seldom on real biological data for which a "correct answer" is available. In order to address this issue, we use the manually curated high-quality Arabidopsis thaliana gene family database as a "gold standard" to conduct a comprehensive comparison of the accuracies of four widely used clustering methods including K-means, TribeMCL, single-linkage clustering and complete-linkage clustering. We compare the results from running different clustering methods on two matrices: the E-value matrix and the k-tuple distance matrix. The E-value matrix is computed based on BLAST E-values. The k-tuple distance matrix is computed based on the difference in tuple frequencies. The TribeMCL with the E-value matrix performed best, with the Inflation parameter (=1.15) tuned considerably lower than what has been suggested previously (=2). The single-linkage clustering method with the E-value matrix was second best. Single-linkage clustering, K-means clustering, complete-linkage clustering, and TribeMCL with a k-tuple distance matrix performed reasonably well. Complete-linkage clustering with the k-tuple distance matrix performed the worst.
引用
收藏
页码:439 / 447
页数:9
相关论文
共 18 条
  • [1] [Anonymous], 1975, CLUSTERING ALGORITHM
  • [2] [Anonymous], 2000, CLUSTER ALGORITHM GR
  • [4] COMPLEX LOCI IN MICROORGANISMS
    DEMEREC, M
    HARTMAN, PE
    [J]. ANNUAL REVIEW OF MICROBIOLOGY, 1959, 13 : 377 - 406
  • [5] Dongen S.V., 2000, Ph.D. Thesis
  • [6] Everitt BS, 1993, CLUSTER ANAL
  • [7] TAIR: A resource for integrated Arabidopsis data
    Garcia-Hernandez M.
    Berardini T.Z.
    Chen G.
    Crist D.
    Doyle A.
    Huala E.
    Knee E.
    Lambrecht M.
    Miller N.
    Mueller L.A.
    Mundodi S.
    Reiser L.
    Rhee S.Y.
    Scholl R.
    Tacklind J.
    Weems D.C.
    Wu Y.
    Xu I.
    Yoo D.
    Yoon J.
    Zhang P.
    [J]. Functional & Integrative Genomics, 2002, 2 (6) : 239 - 253
  • [8] COMPARING PARTITIONS
    HUBERT, L
    ARABIE, P
    [J]. JOURNAL OF CLASSIFICATION, 1985, 2 (2-3) : 193 - 218
  • [9] The SYSTERS protein sequence cluster set
    Krause, A
    Stoye, J
    Vingron, M
    [J]. NUCLEIC ACIDS RESEARCH, 2000, 28 (01) : 270 - 272
  • [10] ORENGO C, 2003, BIOINFORMATICS GENES