메뉴 건너뛰기




Volumn 21, Issue 8, 2005, Pages 1735-1736

CLUSTAG: Hierarchical clustering and graph methods for selecting tag SNPs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; CHROMOSOME; CLUSTER ANALYSIS; COMPUTER GRAPHICS; COMPUTER PROGRAM; CONTROLLED STUDY; CORRELATION ANALYSIS; DEVICE; HUMAN; PRIORITY JOURNAL; SINGLE NUCLEOTIDE POLYMORPHISM;

EID: 17444385286     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/bti201     Document Type: Article
Times cited : (80)

References (6)
  • 2
    • 13444269543 scopus 로고    scopus 로고
    • Haploview: Analysis and visualization of LD and haplotype maps
    • Barrett,J.C., Fry,B., Maller,J. and Daly,M.J. (2005) Haploview: analysis and visualization of LD and haplotype maps. Bioinformatics, 21, 263-265.
    • (2005) Bioinformatics , vol.21 , pp. 263-265
    • Barrett, J.C.1    Fry, B.2    Maller, J.3    Daly, M.J.4
  • 4
    • 0346373654 scopus 로고    scopus 로고
    • Selecting a maximally informative set of single-nucleotide polymorphisms for association analyses using linkage disequilibrium
    • Carlson,C., Eberle,M.A., Rieder,M.J., Yi,Q., Kruglyak,L. and Nickerson,D.A. (2004) Selecting a maximally informative set of single-nucleotide polymorphisms for association analyses using linkage disequilibrium. Am. J. Hum. Genet., 74, 106-120.
    • (2004) Am. J. Hum. Genet. , vol.74 , pp. 106-120
    • Carlson, C.1    Eberle, M.A.2    Rieder, M.J.3    Yi, Q.4    Kruglyak, L.5    Nickerson, D.A.6
  • 6
    • 6344228239 scopus 로고    scopus 로고
    • Approximating the dense set-cover problem
    • Reuven,Y. and Zehavit,K. (2004) Approximating the dense set-cover problem. J. Comput. Syst. Sci., 69, 547-561.
    • (2004) J. Comput. Syst. Sci. , vol.69 , pp. 547-561
    • Reuven, Y.1    Zehavit, K.2


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