메뉴 건너뛰기




Volumn 31, Issue 5, 2005, Pages 523-527

A novel parallelization approach for hierarchical clustering

Author keywords

Clustering; Gene expression; Parallelization

Indexed keywords

DISEASES; GENES; HIERARCHICAL SYSTEMS; IDENTIFICATION (CONTROL SYSTEMS); PARALLEL ALGORITHMS; PROBLEM SOLVING; TUMORS;

EID: 19844371026     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2005.01.001     Document Type: Article
Times cited : (34)

References (9)
  • 1
    • 0029358115 scopus 로고
    • Parallel algorithms for hierarchical clustering
    • C.F. Olson Parallel algorithms for hierarchical clustering Parallel Computing 21 1995 1313 1325
    • (1995) Parallel Computing , vol.21 , pp. 1313-1325
    • Olson, C.F.1
  • 2
    • 0024619684 scopus 로고
    • Efficiency of hierarchical agglomerative clustering using the ICL distributed array processors
    • E.M. Rasmussen, and P. Willett Efficiency of hierarchical agglomerative clustering using the ICL distributed array processors Journal of Documentation 45 1 1989 1 24
    • (1989) Journal of Documentation , vol.45 , Issue.1 , pp. 1-24
    • Rasmussen, E.M.1    Willett, P.2
  • 3
    • 0033031437 scopus 로고    scopus 로고
    • DNA arrays for analysis gene expression
    • M.B. Eisen, P.O. Brown. DNA arrays for analysis gene expression, In: Methods in Enzymology, vol. 303, 1999, pp. 179-205.
    • (1999) Methods in Enzymology , vol.303 , pp. 179-205
    • Eisen, M.B.1    Brown, P.O.2
  • 4
    • 0024107868 scopus 로고
    • Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation
    • J.R. Driscoll, H.N. Gabow, R. Shrairman, and R.E. Tarjan Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation Communications of the ACM 31 11 1988 1343 1354
    • (1988) Communications of the ACM , vol.31 , Issue.11 , pp. 1343-1354
    • Driscoll, J.R.1    Gabow, H.N.2    Shrairman, R.3    Tarjan, R.E.4
  • 6
    • 84911584312 scopus 로고
    • Shortest connection networks and some generalizations
    • R.C. Prim Shortest connection networks and some generalizations Bell System Technical Journal 36 1957 1389 1401
    • (1957) Bell System Technical Journal , vol.36 , pp. 1389-1401
    • Prim, R.C.1
  • 7
    • 0002663098 scopus 로고
    • SLINK: An optimally efficient algorithm for the single link cluster methods
    • R. Sibson SLINK: an optimally efficient algorithm for the single link cluster methods Computer Journal 16 1973 30 34
    • (1973) Computer Journal , vol.16 , pp. 30-34
    • Sibson, R.1
  • 8
    • 0024718536 scopus 로고
    • Parallel clustering algorithms
    • X. Li, and Z. Fang Parallel clustering algorithms Parallel Computing 11 1989 275 290
    • (1989) Parallel Computing , vol.11 , pp. 275-290
    • Li, X.1    Fang, Z.2
  • 9
    • 2942511492 scopus 로고    scopus 로고
    • Cancer characterization and feature set extraction by discriminative margin clustering
    • M. Kamesh, T. Rob, and O.B. Patrick Cancer characterization and feature set extraction by discriminative margin clustering BMC Bioinformatics 5 March 2004 21
    • (2004) BMC Bioinformatics , vol.5 , pp. 21
    • Kamesh, M.1    Rob, T.2    Patrick, O.B.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.