메뉴 건너뛰기




Volumn 19, Issue 10, 2003, Pages 1221-1226

Fast sequence clustering using a suffix array algorithm

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ANALYTIC METHOD; ARTICLE; CALCULATION; CLUSTER ANALYSIS; COMPUTER PROGRAM; CONTROLLED STUDY; EXPRESSED SEQUENCE TAG; GENE CLUSTER; GENE SEQUENCE; INTERMETHOD COMPARISON; PRIORITY JOURNAL; SCORING SYSTEM; SENSITIVITY AND SPECIFICITY; VALIDATION PROCESS;

EID: 0038494602     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btg138     Document Type: Article
Times cited : (33)

References (14)
  • 2
    • 0029355897 scopus 로고
    • ESTablishing a human transcript map
    • Boguski,M. and Schuler,G. (1995) ESTablishing a human transcript map. Nat. Genet., 10, 369-371.
    • (1995) Nat. Genet. , vol.10 , pp. 369-371
    • Boguski, M.1    Schuler, G.2
  • 3
    • 0032703998 scopus 로고    scopus 로고
    • d2uster: A validated method for clustering EST and full-length cDNA sequences
    • Burke,J., Davidson,D. and Hide,W. (1999) d2uster: A validated method for clustering EST and full-length cDNA sequences. Genome Res., 9, 1135-1142.
    • (1999) Genome Res. , vol.9 , pp. 1135-1142
    • Burke, J.1    Davidson, D.2    Hide, W.3
  • 4
    • 0029542348 scopus 로고
    • A comparison of imperative and purely functional suffix tree constructions
    • Giegerich,R. and Kurtz,S. (1995) A comparison of imperative and purely functional suffix tree constructions. Science of Computer Programming, 25, 187-218.
    • (1995) Science of Computer Programming , vol.25 , pp. 187-218
    • Giegerich, R.1    Kurtz, S.2
  • 5
  • 6
    • 0031829372 scopus 로고    scopus 로고
    • Removing near-neighbour redundancy from large protein sequence collections
    • Holm,L. and Sander,C. (1998) Removing near-neighbour redundancy from large protein sequence collections. Bioinformatics, 14, 423-429.
    • (1998) Bioinformatics , vol.14 , pp. 423-429
    • Holm, L.1    Sander, C.2
  • 9
    • 0023989064 scopus 로고
    • Improved tools for biological sequence comparison
    • Lipman,D.J. and Pearson,W.R. (1988) Improved tools for biological sequence comparison. Proc. Natl Acad. Sci. USA, 85, 2444-2448.
    • (1988) Proc. Natl. Acad. Sci. USA , vol.85 , pp. 2444-2448
    • Lipman, D.J.1    Pearson, W.R.2
  • 10
    • 0027681165 scopus 로고
    • Suffix arrays: A new method for on-line string searches
    • Manber,U. and Myers,G. (1993) Suffix arrays: a new method for on-line string searches. SIAM J. Comput., 22, 935-948.
    • (1993) SIAM J. Comput. , vol.22 , pp. 935-948
    • Manber, U.1    Myers, G.2
  • 11
    • 0016942292 scopus 로고
    • A space-economical suffix tree construction algorithm
    • McCreight,E.M. (1976) A space-economical suffix tree construction algorithm. J. Adv. Comput. Machinery, 23, 262-272.
    • (1976) J. Adv. Comput. Machinery , vol.23 , pp. 262-272
    • McCreight, E.M.1
  • 12
    • 12444313151 scopus 로고    scopus 로고
    • Accurate, parallel clustering of EST (gene) sequences
    • Master's Thesis, University of Iowa, Department of Electrical and Computer Engineering
    • Pedretti,K. (2001) Accurate, parallel clustering of EST (gene) sequences, Master's Thesis, University of Iowa, Department of Electrical and Computer Engineering.
    • (2001)
    • Pedretti, K.1
  • 13
    • 0001704377 scopus 로고
    • On-line construction of suffix-trees
    • Ukkonen,E. (1995) On-line construction of suffix-trees. Algorithmica, 14, 249-260.
    • (1995) Algorithmica , vol.14 , pp. 249-260
    • Ukkonen, E.1


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